./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk --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 ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:10:31,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:10:31,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:10:31,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:10:31,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:10:31,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:10:31,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:10:31,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:10:31,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:10:31,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:10:31,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:10:31,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:10:31,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:10:31,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:10:31,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:10:31,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:10:31,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:10:31,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:10:31,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:10:31,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:10:31,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:10:31,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:10:31,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:10:31,844 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:10:31,844 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:10:31,844 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:10:31,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:10:31,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:10:31,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:10:31,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:10:31,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:10:31,846 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:10:31,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:10:31,849 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk 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 -> ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d [2024-11-09 00:10:32,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:10:32,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:10:32,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:10:32,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:10:32,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:10:32,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c Unable to find full path for "g++" [2024-11-09 00:10:34,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:10:34,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:10:34,600 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2024-11-09 00:10:34,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/data/94a00c818/49198e1b66e8463682c7d87e7ada1fc6/FLAG6c2bd5f55 [2024-11-09 00:10:34,957 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/data/94a00c818/49198e1b66e8463682c7d87e7ada1fc6 [2024-11-09 00:10:34,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:10:34,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:10:34,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:10:34,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:10:34,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:10:34,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:34" (1/1) ... [2024-11-09 00:10:34,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446bff0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:34, skipping insertion in model container [2024-11-09 00:10:34,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:34" (1/1) ... [2024-11-09 00:10:35,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:10:35,241 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_cafae381-c252-438c-bf02-7d61d79f7d61/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2024-11-09 00:10:35,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:10:35,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:10:35,304 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_cafae381-c252-438c-bf02-7d61d79f7d61/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2024-11-09 00:10:35,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:10:35,345 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:10:35,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35 WrapperNode [2024-11-09 00:10:35,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:10:35,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:10:35,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:10:35,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:10:35,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,392 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-09 00:10:35,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:10:35,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:10:35,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:10:35,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:10:35,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:10:35,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:10:35,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:10:35,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:10:35,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:10:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:10:35,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:10:35,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafae381-c252-438c-bf02-7d61d79f7d61/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:10:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:10:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:10:35,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:10:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:10:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:10:35,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:10:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 00:10:35,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 00:10:35,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:10:35,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:10:35,790 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 00:10:35,790 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:10:35,826 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:10:35,827 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 00:10:35,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:35 BoogieIcfgContainer [2024-11-09 00:10:35,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:10:35,828 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:10:35,828 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:10:35,841 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:10:35,842 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:35" (1/1) ... [2024-11-09 00:10:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:10:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-11-09 00:10:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-11-09 00:10:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:10:35,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:10:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-11-09 00:10:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-09 00:10:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:10:36,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:10:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 29 states and 41 transitions. [2024-11-09 00:10:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2024-11-09 00:10:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:10:36,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:36,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:10:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:36,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 00:10:36,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:10:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:10:38,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 00:10:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-11-09 00:10:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-11-09 00:10:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:10:39,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:10:42,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 00:10:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 35 states and 54 transitions. [2024-11-09 00:10:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2024-11-09 00:10:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:10:43,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:10:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:10:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 38 states and 57 transitions. [2024-11-09 00:10:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2024-11-09 00:10:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:10:43,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:10:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:10:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:10:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:11:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-09 00:11:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-09 00:11:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:11:08,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:11:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-09 00:11:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-09 00:11:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:11:08,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:11:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 70 transitions. [2024-11-09 00:11:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 70 transitions. [2024-11-09 00:11:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:11:30,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:11:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:11:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 49 states and 79 transitions. [2024-11-09 00:11:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2024-11-09 00:11:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:11:49,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:11:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:11:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:11:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:12:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:12:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 51 states and 83 transitions. [2024-11-09 00:12:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2024-11-09 00:12:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:12:00,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:12:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:12:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:12:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:12:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:12:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 59 states and 98 transitions. [2024-11-09 00:12:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 98 transitions. [2024-11-09 00:12:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:12:35,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:12:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:12:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:12:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:12:35,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:12:35,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:12:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:13:04,245 WARN L286 SmtUtils]: Spent 6.30s 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-11-09 00:13:28,481 WARN L286 SmtUtils]: Spent 7.00s 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-11-09 00:13:55,117 WARN L286 SmtUtils]: Spent 9.61s 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-11-09 00:14:12,318 WARN L286 SmtUtils]: Spent 15.26s on a formula simplification. DAG size of input: 36 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:14:44,982 WARN L286 SmtUtils]: Spent 8.95s 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-11-09 00:15:22,644 WARN L286 SmtUtils]: Spent 6.32s 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-11-09 00:15:38,941 WARN L286 SmtUtils]: Spent 13.55s 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-11-09 00:16:12,362 WARN L286 SmtUtils]: Spent 21.07s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:16:28,390 WARN L286 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:16:38,397 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-11-09 00:17:04,633 WARN L286 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 30 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:17:39,086 WARN L286 SmtUtils]: Spent 14.96s 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-11-09 00:18:03,160 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 28 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:18:43,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 00:18:53,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 00:18:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 68 states and 122 transitions. [2024-11-09 00:18:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 122 transitions. [2024-11-09 00:18:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:18:59,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:18:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:59,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 00:18:59,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:06,629 WARN L286 SmtUtils]: Spent 6.82s 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-11-09 00:19:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 00:19:39,753 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-11-09 00:20:03,892 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-11-09 00:20:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 70 states and 131 transitions. [2024-11-09 00:20:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 131 transitions. [2024-11-09 00:20:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:20:15,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:20:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:15,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:20:15,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:20:34,613 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-11-09 00:20:51,929 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-11-09 00:21:03,520 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-11-09 00:21:18,225 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-11-09 00:21:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 73 states and 145 transitions. [2024-11-09 00:21:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 145 transitions. [2024-11-09 00:21:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:21:24,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:21:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:24,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:21:24,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:21:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:21:44,098 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-11-09 00:21:59,925 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-11-09 00:22:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 76 states and 160 transitions. [2024-11-09 00:22:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 160 transitions. [2024-11-09 00:22:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:22:11,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:22:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:11,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:22:11,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:22:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 78 states and 174 transitions. [2024-11-09 00:22:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 174 transitions. [2024-11-09 00:22:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:22:31,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:31,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:22:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:31,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:22:31,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:22:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 79 states and 179 transitions. [2024-11-09 00:22:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 179 transitions. [2024-11-09 00:22:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:22:44,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:22:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:44,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:22:44,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:22:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:23:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:23:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 83 states and 213 transitions. [2024-11-09 00:23:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 213 transitions. [2024-11-09 00:23:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:23:02,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:23:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:23:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:02,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:23:02,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:24:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:24:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:24:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 85 states and 230 transitions. [2024-11-09 00:24:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 230 transitions. [2024-11-09 00:24:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:24:37,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:24:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:24:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:24:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:37,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 00:24:37,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:24:49,517 WARN L286 SmtUtils]: Spent 10.03s 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-11-09 00:24:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 00:25:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:25:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 87 states and 248 transitions. [2024-11-09 00:25:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 248 transitions. [2024-11-09 00:25:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:25:13,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:25:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:25:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:25:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:25:13,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 00:25:13,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:25:23,351 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-11-09 00:25:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.