./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:25:51,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:25:51,467 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 23:25:51,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:25:51,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:25:51,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:25:51,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 23:25:51,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 23:25:51,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:25:51,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:25:51,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:25:51,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 23:25:51,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:25:51,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:25:51,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:25:51,495 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:25:51,495 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:25:51,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:25:51,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:25:51,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Kojak 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 -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2024-12-05 23:25:51,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:25:51,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:25:51,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:25:51,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:25:51,709 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:25:51,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-12-05 23:25:54,416 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/data/bc0128fbe/e9b625abe21e4896b03339e17cd95499/FLAGb2c287219 [2024-12-05 23:25:54,595 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:25:54,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-12-05 23:25:54,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/data/bc0128fbe/e9b625abe21e4896b03339e17cd95499/FLAGb2c287219 [2024-12-05 23:25:54,617 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/data/bc0128fbe/e9b625abe21e4896b03339e17cd95499 [2024-12-05 23:25:54,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:25:54,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:25:54,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:25:54,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:25:54,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:25:54,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7131efa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54, skipping insertion in model container [2024-12-05 23:25:54,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:25:54,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-12-05 23:25:54,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:25:54,770 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:25:54,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-12-05 23:25:54,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:25:54,796 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:25:54,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54 WrapperNode [2024-12-05 23:25:54,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:25:54,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:25:54,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:25:54,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:25:54,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,822 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-12-05 23:25:54,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:25:54,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:25:54,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:25:54,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:25:54,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:25:54,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:25:54,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:25:54,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:25:54,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:25:54" (1/1) ... [2024-12-05 23:25:54,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:25:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:25:54,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:25:54,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed83d37c-b969-407e-ad81-b902543cbd02/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:25:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:25:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-05 23:25:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-05 23:25:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:25:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:25:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:25:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-05 23:25:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-05 23:25:54,939 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:25:54,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:25:55,063 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-05 23:25:55,063 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:25:55,084 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:25:55,084 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-05 23:25:55,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:25:55 BoogieIcfgContainer [2024-12-05 23:25:55,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:25:55,085 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:25:55,085 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:25:55,094 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:25:55,094 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:25:55" (1/1) ... [2024-12-05 23:25:55,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:25:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:25:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-12-05 23:25:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-12-05 23:25:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:25:55,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:25:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:25:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:25:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:25:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:25:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-12-05 23:25:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-12-05 23:25:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:25:55,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:25:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:25:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:25:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:25:55,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-05 23:25:55,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:25:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:25:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:25:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2024-12-05 23:25:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2024-12-05 23:25:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:25:56,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:25:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:25:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:25:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:25:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:25:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-12-05 23:25:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-12-05 23:25:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 23:25:57,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:25:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:25:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:25:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:26:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 35 states and 55 transitions. [2024-12-05 23:26:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-12-05 23:26:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 23:26:00,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:26:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:26:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 58 transitions. [2024-12-05 23:26:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2024-12-05 23:26:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 23:26:00,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:26:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-05 23:26:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 42 states and 67 transitions. [2024-12-05 23:26:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2024-12-05 23:26:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-05 23:26:27,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:26:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 23:26:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-12-05 23:26:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-12-05 23:26:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-05 23:26:27,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:26:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:26:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 75 transitions. [2024-12-05 23:26:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2024-12-05 23:26:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 23:26:47,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:26:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 23:26:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:26:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 48 states and 79 transitions. [2024-12-05 23:26:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2024-12-05 23:26:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:26:59,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:26:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:26:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:27:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:27:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:27:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 56 states and 94 transitions. [2024-12-05 23:27:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 94 transitions. [2024-12-05 23:27:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:27:23,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:27:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:27:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:27:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:27:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-05 23:27:23,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:27:35,580 WARN L286 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-05 23:27:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:27:56,039 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 32 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:28:05,940 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:28:44,926 WARN L286 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 34 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:29:12,938 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:30:26,154 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:30:47,137 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:30:58,500 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 32 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-05 23:31:52,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-05 23:31:56,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-05 23:31:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:31:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 65 states and 117 transitions. [2024-12-05 23:31:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 117 transitions. [2024-12-05 23:31:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:31:59,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:31:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:31:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:31:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:31:59,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:31:59,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:32:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:32:22,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:32:35,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:32:50,238 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:32:58,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:33:10,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:33:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:33:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 67 states and 127 transitions. [2024-12-05 23:33:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 127 transitions. [2024-12-05 23:33:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:33:22,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:33:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:33:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:33:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:33:22,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:33:22,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:33:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:33:43,107 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:34:03,931 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:34:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 71 states and 149 transitions. [2024-12-05 23:34:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 149 transitions. [2024-12-05 23:34:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:34:08,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:34:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:09,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:34:09,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:34:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:34:36,559 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:34:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:34:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 75 states and 169 transitions. [2024-12-05 23:34:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 169 transitions. [2024-12-05 23:34:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:34:38,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:34:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:34:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:34:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:34:38,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:34:38,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:35:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:35:45,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:36:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:36:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 77 states and 183 transitions. [2024-12-05 23:36:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2024-12-05 23:36:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:36:46,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:36:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:36:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:36:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:36:46,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-05 23:36:46,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:36:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:37:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:37:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 79 states and 195 transitions. [2024-12-05 23:37:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 195 transitions. [2024-12-05 23:37:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:37:10,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:37:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:37:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:37:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:37:10,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:37:10,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:37:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:37:24,578 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-05 23:37:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:37:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 81 states and 208 transitions. [2024-12-05 23:37:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 208 transitions. [2024-12-05 23:37:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:37:56,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:37:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:37:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:37:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:37:56,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:37:56,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:37:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:38:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:38:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 78 states and 184 transitions. [2024-12-05 23:38:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 184 transitions. [2024-12-05 23:38:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:38:36,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:38:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:38:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:38:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:38:36,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-05 23:38:36,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:38:43,265 WARN L286 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-05 23:38:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 23:39:07,570 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:39:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 79 states and 192 transitions. [2024-12-05 23:39:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 192 transitions. [2024-12-05 23:39:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:39:10,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:39:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:10,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:39:10,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:39:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:39:23,748 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-05 23:39:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 81 states and 210 transitions. [2024-12-05 23:39:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 210 transitions. [2024-12-05 23:39:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:39:26,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:39:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:26,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-05 23:39:26,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:39:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 3 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 23:39:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 78 states and 188 transitions. [2024-12-05 23:39:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 188 transitions. [2024-12-05 23:39:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:39:59,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:39:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:59,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:39:59,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:40:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 23:40:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:40:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 81 states and 217 transitions. [2024-12-05 23:40:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 217 transitions. [2024-12-05 23:40:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:40:06,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:40:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:40:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:40:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:40:06,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:40:06,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:40:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 23:40:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:40:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 75 states and 172 transitions. [2024-12-05 23:40:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2024-12-05 23:40:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-05 23:40:57,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:40:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:40:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-05 23:40:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:40:57,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-05 23:40:57,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-05 23:41:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked.