./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c50dd7e64abcc7a7eef6ea31e37156afb1e4322422284686cac6e6613b192c7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:30,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:30,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:30,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:30,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:30,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:30,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:30,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:30,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:30,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:30,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:30,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:30,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:31,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:31,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:31,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:31,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:31,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:31,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:31,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:31,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:31,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:31,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:31,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:31,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:31,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:31,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:31,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:31,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:31,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:31,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:31,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:31,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:31,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:31,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:31,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:31,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:31,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:31,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:31,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:31,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:31,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:41:31,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:31,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:31,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:31,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:31,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:31,053 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:31,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:31,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:31,054 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:31,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:31,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:31,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:31,056 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:31,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:31,056 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:31,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:31,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:31,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:31,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:31,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:31,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:31,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:31,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:31,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c50dd7e64abcc7a7eef6ea31e37156afb1e4322422284686cac6e6613b192c7 [2022-02-20 17:41:31,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:31,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:31,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:31,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:31,263 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:31,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-02-20 17:41:31,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18656f354/0494648581cc4f3d9693f03d719264be/FLAG3f702e78d [2022-02-20 17:41:31,641 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:31,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-02-20 17:41:31,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18656f354/0494648581cc4f3d9693f03d719264be/FLAG3f702e78d [2022-02-20 17:41:32,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18656f354/0494648581cc4f3d9693f03d719264be [2022-02-20 17:41:32,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:32,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:32,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:32,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:32,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:32,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59277b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32, skipping insertion in model container [2022-02-20 17:41:32,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:32,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:32,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c[458,471] [2022-02-20 17:41:32,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:32,240 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:32,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound10.c[458,471] [2022-02-20 17:41:32,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:32,275 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:32,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32 WrapperNode [2022-02-20 17:41:32,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:32,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:32,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:32,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:32,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,305 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-02-20 17:41:32,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:32,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:32,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:32,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:32,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:32,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:32,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:32,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:32,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (1/1) ... [2022-02-20 17:41:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:32,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:41:32,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:41:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:32,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:32,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:32,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:32,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:32,420 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:32,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:32,509 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:32,520 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:32,520 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:32,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:32 BoogieIcfgContainer [2022-02-20 17:41:32,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:32,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:32,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:32,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:32,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:32" (1/3) ... [2022-02-20 17:41:32,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d82602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:32, skipping insertion in model container [2022-02-20 17:41:32,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:32" (2/3) ... [2022-02-20 17:41:32,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d82602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:32, skipping insertion in model container [2022-02-20 17:41:32,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:32" (3/3) ... [2022-02-20 17:41:32,548 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound10.c [2022-02-20 17:41:32,552 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:32,552 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:32,607 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:32,611 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:41:32,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:32,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:32,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:32,647 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2022-02-20 17:41:32,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:32,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906549119] [2022-02-20 17:41:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:32,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23#true} is VALID [2022-02-20 17:41:32,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 17:41:32,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 17:41:32,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {24#false} is VALID [2022-02-20 17:41:32,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 17:41:32,824 INFO L272 TraceCheckUtils]: 5: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {24#false} is VALID [2022-02-20 17:41:32,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-02-20 17:41:32,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-02-20 17:41:32,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 17:41:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:32,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:32,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906549119] [2022-02-20 17:41:32,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906549119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:32,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:32,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:32,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616883158] [2022-02-20 17:41:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:32,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:32,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:32,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:32,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:32,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:32,873 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,925 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-02-20 17:41:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:41:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:41:32,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2022-02-20 17:41:33,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,030 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:41:33,030 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:41:33,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:33,035 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:33,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:41:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:41:33,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:33,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,060 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,060 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,063 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:33,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:41:33,064 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-02-20 17:41:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,066 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:33,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:33,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:41:33,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2022-02-20 17:41:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:33,070 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:41:33,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:41:33,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:33,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:33,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:33,072 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2022-02-20 17:41:33,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:33,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516309580] [2022-02-20 17:41:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:41:33,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:41:33,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {131#(= ~counter~0 0)} is VALID [2022-02-20 17:41:33,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:41:33,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:41:33,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {130#false} is VALID [2022-02-20 17:41:33,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {130#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {130#false} is VALID [2022-02-20 17:41:33,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-02-20 17:41:33,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-02-20 17:41:33,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-02-20 17:41:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:33,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:33,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516309580] [2022-02-20 17:41:33,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516309580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:33,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:33,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:41:33,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77882168] [2022-02-20 17:41:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:41:33,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:33,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:41:33,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:41:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:33,132 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,170 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:41:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:41:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:41:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:41:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:41:33,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 17:41:33,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,197 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:33,197 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:41:33,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:33,198 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:33,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:41:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:41:33,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:33,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,201 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,202 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,203 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:41:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:41:33,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 17:41:33,204 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-02-20 17:41:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,205 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:41:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:41:33,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:33,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 17:41:33,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-02-20 17:41:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:33,207 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 17:41:33,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:41:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:41:33,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:33,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:33,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:41:33,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2022-02-20 17:41:33,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:33,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555908617] [2022-02-20 17:41:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:33,219 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:33,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156863104] [2022-02-20 17:41:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:33,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:41:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:33,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {230#true} is VALID [2022-02-20 17:41:33,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {230#true} is VALID [2022-02-20 17:41:33,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(0 == assume_abort_if_not_~cond#1); {230#true} is VALID [2022-02-20 17:41:33,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:33,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:33,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:33,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:33,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:33,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {231#false} is VALID [2022-02-20 17:41:33,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 17:41:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:33,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:33,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:33,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555908617] [2022-02-20 17:41:33,351 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:33,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156863104] [2022-02-20 17:41:33,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156863104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:33,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:33,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:33,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703872759] [2022-02-20 17:41:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:33,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:41:33,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:33,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:33,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:33,361 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,439 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:41:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:41:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:41:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:41:33,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-20 17:41:33,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,467 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:41:33,468 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:41:33,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:41:33,469 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:33,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:41:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:41:33,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:33,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,473 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,473 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,474 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:41:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:41:33,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:41:33,475 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:41:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,476 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:41:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:41:33,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:41:33,478 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:41:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:33,479 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:41:33,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:41:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:41:33,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:33,480 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:33,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:33,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:33,697 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2022-02-20 17:41:33,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:33,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885796086] [2022-02-20 17:41:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:33,711 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:33,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934888157] [2022-02-20 17:41:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:33,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:41:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:33,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:33,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:33,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:33,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:33,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(<= ~counter~0 1)} ~cond := #in~cond; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(<= ~counter~0 1)} assume !(0 == ~cond); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(<= ~counter~0 1)} assume true; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {402#(<= ~counter~0 1)} {402#(<= ~counter~0 1)} #47#return; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:33,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {402#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:41:33,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:41:33,878 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:41:33,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:41:33,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:41:33,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:41:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:33,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:33,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:41:34,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:41:34,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:41:34,002 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:41:34,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(< |ULTIMATE.start_main_#t~post5#1| 10)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:41:34,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(< ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {455#(< |ULTIMATE.start_main_#t~post5#1| 10)} is VALID [2022-02-20 17:41:34,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(< ~counter~0 10)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {459#(< ~counter~0 10)} is VALID [2022-02-20 17:41:34,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {384#true} {459#(< ~counter~0 10)} #47#return; {459#(< ~counter~0 10)} is VALID [2022-02-20 17:41:34,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#true} assume true; {384#true} is VALID [2022-02-20 17:41:34,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(0 == ~cond); {384#true} is VALID [2022-02-20 17:41:34,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#true} ~cond := #in~cond; {384#true} is VALID [2022-02-20 17:41:34,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {459#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {384#true} is VALID [2022-02-20 17:41:34,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#(< ~counter~0 10)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {459#(< ~counter~0 10)} is VALID [2022-02-20 17:41:34,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(< ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {459#(< ~counter~0 10)} is VALID [2022-02-20 17:41:34,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(< ~counter~0 9)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {484#(< ~counter~0 9)} is VALID [2022-02-20 17:41:34,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(< ~counter~0 9)} assume !(0 == assume_abort_if_not_~cond#1); {484#(< ~counter~0 9)} is VALID [2022-02-20 17:41:34,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(< ~counter~0 9)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {484#(< ~counter~0 9)} is VALID [2022-02-20 17:41:34,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {484#(< ~counter~0 9)} is VALID [2022-02-20 17:41:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:34,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:34,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885796086] [2022-02-20 17:41:34,025 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:34,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934888157] [2022-02-20 17:41:34,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934888157] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:34,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:34,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:41:34,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061281012] [2022-02-20 17:41:34,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:41:34,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:34,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:34,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:34,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:34,051 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,242 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-02-20 17:41:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:41:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:41:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:41:34,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-02-20 17:41:34,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,322 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:41:34,323 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:41:34,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:34,325 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:34,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:41:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 17:41:34,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:34,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:34,351 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:34,352 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,356 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:41:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:41:34,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:41:34,357 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:41:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,364 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:41:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:41:34,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:34,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-02-20 17:41:34,366 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2022-02-20 17:41:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:34,366 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-02-20 17:41:34,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-02-20 17:41:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:41:34,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:34,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:34,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:34,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:41:34,585 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2022-02-20 17:41:34,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:34,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754472221] [2022-02-20 17:41:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:34,599 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:34,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606833325] [2022-02-20 17:41:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:34,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:34,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:34,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:34,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:41:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:34,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:34,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:34,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:41:34,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:41:34,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:41:34,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:34,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:34,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:34,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:41:34,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:41:34,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:41:34,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:41:34,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:34,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:41:34,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:41:34,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:41:34,740 INFO L272 TraceCheckUtils]: 14: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:34,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:34,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:41:34,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:41:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:34,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:34,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:41:34,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:41:34,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:34,851 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:34,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:34,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:36,867 WARN L290 TraceCheckUtils]: 11: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is UNKNOWN [2022-02-20 17:41:36,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} #47#return; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:36,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:41:36,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:41:36,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:41:36,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:41:36,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:36,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:36,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:41:36,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:41:36,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:41:36,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:41:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:41:36,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:36,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754472221] [2022-02-20 17:41:36,872 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:36,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606833325] [2022-02-20 17:41:36,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606833325] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:36,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:36,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:36,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660240516] [2022-02-20 17:41:36,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:41:36,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:36,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:38,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:38,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:38,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:38,968 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:39,095 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-02-20 17:41:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:41:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:41:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:41:39,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-02-20 17:41:39,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:39,601 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:41:39,602 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:41:39,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:39,602 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:39,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:41:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-02-20 17:41:39,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:39,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:39,620 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:39,620 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:39,622 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:41:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:41:39,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:39,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:39,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:41:39,623 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:41:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:39,624 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:41:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:41:39,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:39,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:39,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:39,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-02-20 17:41:39,626 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2022-02-20 17:41:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:39,626 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-02-20 17:41:39,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-02-20 17:41:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:41:39,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:39,627 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:39,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:39,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:39,838 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2022-02-20 17:41:39,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:39,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270618822] [2022-02-20 17:41:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:39,858 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:39,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559525746] [2022-02-20 17:41:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:39,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:39,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:41:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:39,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:39,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:40,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1110#true} is VALID [2022-02-20 17:41:40,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1110#true} is VALID [2022-02-20 17:41:40,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume !(0 == assume_abort_if_not_~cond#1); {1110#true} is VALID [2022-02-20 17:41:40,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {1110#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:40,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:40,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:40,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:41:40,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:41:40,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:41:40,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:41:40,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1110#true} {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:40,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,179 INFO L272 TraceCheckUtils]: 14: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:41:40,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:41:40,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:41:40,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:41:40,181 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1110#true} {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #47#return; {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,187 INFO L272 TraceCheckUtils]: 20: Hoare triple {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:41:40,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:41:40,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:41:40,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:41:40,189 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1110#true} {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:40,189 INFO L272 TraceCheckUtils]: 25: Hoare triple {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:40,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:40,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {1197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-02-20 17:41:40,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-02-20 17:41:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:40,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:40,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:40,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270618822] [2022-02-20 17:41:40,442 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:40,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559525746] [2022-02-20 17:41:40,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559525746] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:40,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:40,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:40,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245871865] [2022-02-20 17:41:40,442 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:40,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:40,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:40,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:40,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:40,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:40,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:40,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:40,467 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:40,656 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-02-20 17:41:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:41:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:41:40,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 17:41:40,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:40,689 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:41:40,690 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:41:40,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:40,691 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:40,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:41:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:41:40,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:40,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:40,708 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:40,709 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:40,710 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:41:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:41:40,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:40,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:40,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:41:40,711 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:41:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:40,712 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:41:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:41:40,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:40,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:40,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:40,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-20 17:41:40,715 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2022-02-20 17:41:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:40,715 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-20 17:41:40,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:41:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:41:40,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:40,716 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:40,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:40,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:40,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1793229318, now seen corresponding path program 2 times [2022-02-20 17:41:40,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:40,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409659630] [2022-02-20 17:41:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:40,957 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:40,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506340925] [2022-02-20 17:41:40,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:40,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:40,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:41:41,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:41,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:41,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:41:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:41,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:41,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1490#true} is VALID [2022-02-20 17:41:41,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1490#true} is VALID [2022-02-20 17:41:41,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume !(0 == assume_abort_if_not_~cond#1); {1490#true} is VALID [2022-02-20 17:41:41,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {1490#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:41,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:41,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:41,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:41:41,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:41:41,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:41:41,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:41:41,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1490#true} {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:41,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:41,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:41,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:41,356 INFO L272 TraceCheckUtils]: 14: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:41:41,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:41:41,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:41:41,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:41:41,357 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1490#true} {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:41,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:41,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:41,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:41,358 INFO L272 TraceCheckUtils]: 22: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:41:41,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:41:41,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:41:41,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:41:41,359 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1490#true} {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #47#return; {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:41,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:41,359 INFO L272 TraceCheckUtils]: 28: Hoare triple {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:41:41,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:41:41,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:41:41,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:41:41,360 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1490#true} {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:41,360 INFO L272 TraceCheckUtils]: 33: Hoare triple {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:41,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:41,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1491#false} is VALID [2022-02-20 17:41:41,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-02-20 17:41:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:41:41,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:41,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:41,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409659630] [2022-02-20 17:41:41,690 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:41,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506340925] [2022-02-20 17:41:41,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506340925] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:41,690 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:41,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:41:41,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766737753] [2022-02-20 17:41:41,691 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:41:41,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:41,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:41,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:41,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:41,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:41,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:41,720 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:41,988 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 17:41:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:41:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:41:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:41:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:41:41,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 17:41:42,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:42,032 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:41:42,032 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:41:42,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:42,033 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:42,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:41:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:41:42,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:42,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:42,048 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:42,048 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:42,049 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:41:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:41:42,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:42,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:42,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:41:42,050 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:41:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:42,051 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:41:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:41:42,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:42,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:42,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:42,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 17:41:42,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2022-02-20 17:41:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:42,053 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 17:41:42,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:41:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:41:42,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:42,053 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:42,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:42,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:42,258 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1183870932, now seen corresponding path program 3 times [2022-02-20 17:41:42,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:42,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597157977] [2022-02-20 17:41:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:42,274 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:42,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434401134] [2022-02-20 17:41:42,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:42,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process