./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.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_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/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_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/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_aae8bbb4-9a89-4420-9871-752fdee1ba40/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 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:29:13,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:29:13,762 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:29:13,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:29:13,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:29:13,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:29:13,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:29:13,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:29:13,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:29:13,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:29:13,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:29:13,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:29:13,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:29:13,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:29:13,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:29:13,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:29:13,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:29:13,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:29:13,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:29:13,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:29:13,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:29:13,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:29:13,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:29:13,801 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:29:13,801 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:29:13,802 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:29:13,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:29:13,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:29:13,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:29:13,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:29:13,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:29:13,807 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:29:13,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:29:13,808 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_aae8bbb4-9a89-4420-9871-752fdee1ba40/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_aae8bbb4-9a89-4420-9871-752fdee1ba40/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 -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2024-11-08 22:29:14,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:29:14,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:29:14,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:29:14,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:29:14,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:29:14,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c Unable to find full path for "g++" [2024-11-08 22:29:16,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:29:16,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:29:16,664 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-11-08 22:29:16,672 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/data/17c005dcc/6ee622805bb148e2be525a4963f6c6f3/FLAG24839b0ba [2024-11-08 22:29:17,042 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/data/17c005dcc/6ee622805bb148e2be525a4963f6c6f3 [2024-11-08 22:29:17,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:29:17,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:29:17,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:29:17,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:29:17,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:29:17,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d67d571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17, skipping insertion in model container [2024-11-08 22:29:17,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:29:17,261 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_aae8bbb4-9a89-4420-9871-752fdee1ba40/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-08 22:29:17,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:29:17,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:29:17,315 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_aae8bbb4-9a89-4420-9871-752fdee1ba40/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-08 22:29:17,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:29:17,353 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:29:17,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17 WrapperNode [2024-11-08 22:29:17,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:29:17,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:29:17,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:29:17,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:29:17,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,397 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-08 22:29:17,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:29:17,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:29:17,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:29:17,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:29:17,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:29:17,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:29:17,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:29:17,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:29:17,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:29:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:29:17,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:29:17,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aae8bbb4-9a89-4420-9871-752fdee1ba40/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:29:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:29:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:29:17,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:29:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:29:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:29:17,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:29:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 22:29:17,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 22:29:17,573 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:29:17,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:29:17,796 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-08 22:29:17,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:29:17,839 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:29:17,839 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 22:29:17,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:17 BoogieIcfgContainer [2024-11-08 22:29:17,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:29:17,841 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:29:17,841 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:29:17,853 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:29:17,853 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:17" (1/1) ... [2024-11-08 22:29:17,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:29:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-11-08 22:29:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-11-08 22:29:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:29:17,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:18,143 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-08 22:29:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-11-08 22:29:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-08 22:29:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:29:18,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:18,410 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-08 22:29:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 29 states and 41 transitions. [2024-11-08 22:29:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2024-11-08 22:29:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:29:18,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:29:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:18,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 22:29:18,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:29:19,073 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-08 22:29:20,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 22:29:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-11-08 22:29:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-11-08 22:29:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:29:21,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:22,510 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-08 22:29:24,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 22:29:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 35 states and 54 transitions. [2024-11-08 22:29:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2024-11-08 22:29:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:29:25,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:25,620 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-08 22:29:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 38 states and 57 transitions. [2024-11-08 22:29:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2024-11-08 22:29:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:29:25,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:25,945 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-08 22:30:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-08 22:30:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-08 22:30:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:08,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:08,806 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-08 22:30:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-08 22:30:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-08 22:30:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:30:09,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:09,148 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-08 22:30:23,646 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 33 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:30:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 70 transitions. [2024-11-08 22:30:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 70 transitions. [2024-11-08 22:30:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:30:31,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:31,946 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-08 22:30:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 49 states and 79 transitions. [2024-11-08 22:30:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2024-11-08 22:30:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 22:30:56,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:56,291 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-08 22:31:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 51 states and 83 transitions. [2024-11-08 22:31:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2024-11-08 22:31:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:31:07,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:08,334 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-08 22:31:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 59 states and 98 transitions. [2024-11-08 22:31:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 98 transitions. [2024-11-08 22:31:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:31:46,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:31:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:47,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 22:31:47,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:31:54,603 WARN L286 SmtUtils]: Spent 5.51s 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-08 22:32:08,678 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-08 22:32:54,939 WARN L286 SmtUtils]: Spent 21.53s 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-08 22:33:55,165 WARN L286 SmtUtils]: Spent 12.00s 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-08 22:34:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 22:34:20,531 WARN L286 SmtUtils]: Spent 6.13s 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-08 22:34:32,908 WARN L286 SmtUtils]: Spent 9.93s 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-08 22:35:06,705 WARN L286 SmtUtils]: Spent 7.36s 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-08 22:35:37,222 WARN L286 SmtUtils]: Spent 6.07s 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-08 22:36:04,342 WARN L286 SmtUtils]: Spent 8.13s 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-08 22:36:37,820 WARN L286 SmtUtils]: Spent 15.07s 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-11-08 22:36:50,829 WARN L286 SmtUtils]: Spent 7.54s 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-08 22:38:04,930 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-08 22:38:09,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 22:38:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:38:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 68 states and 121 transitions. [2024-11-08 22:38:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 121 transitions. [2024-11-08 22:38:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:38:12,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:38:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:38:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:12,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:38:12,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:19,759 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-08 22:38:29,820 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-08 22:38:58,968 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-08 22:39:08,977 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-08 22:39:26,116 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-11-08 22:39:36,123 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-11-08 22:39:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:39:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 71 states and 137 transitions. [2024-11-08 22:39:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 137 transitions. [2024-11-08 22:39:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:39:39,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:39:39,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:39:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:39:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:39:39,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 22:39:39,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:39:52,787 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-08 22:40:14,544 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-08 22:40:27,505 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-08 22:40:37,516 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-08 22:40:47,524 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-08 22:40:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:40:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 75 states and 161 transitions. [2024-11-08 22:40:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 161 transitions. [2024-11-08 22:40:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:40:59,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:40:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:40:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:40:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:40:59,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:40:59,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:41: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-11-08 22:41:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:41:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 77 states and 171 transitions. [2024-11-08 22:41:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 171 transitions. [2024-11-08 22:41:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:41:19,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:41:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:41:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:41:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:41:19,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:41:19,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:41:34,063 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-08 22:41:44,090 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-08 22:41:54,126 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-11-08 22:42:04,134 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-11-08 22:42:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 83 states and 208 transitions. [2024-11-08 22:42:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 208 transitions. [2024-11-08 22:42:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:42:06,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:42:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:06,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:42:06,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:42:16,814 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-08 22:42:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 85 states and 221 transitions. [2024-11-08 22:42:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 221 transitions. [2024-11-08 22:42:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:42:23,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:42:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:23,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 22:42:23,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:42:33,322 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-08 22:42:41,682 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-08 22:42:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:42:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 88 states and 245 transitions. [2024-11-08 22:42:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 245 transitions. [2024-11-08 22:42:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:42:46,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:42:46,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:42:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:42:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:42:46,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 22:42:46,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:42:54,447 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 22:43:06,066 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-08 22:43:27,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0)) (.cse4 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (= .cse0 (let ((.cse1 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse1 .cse1))) (not (and .cse2 (<= .cse0 (let ((.cse3 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (* .cse3 .cse3))) .cse4)) (<= c_~counter~0 1) .cse2 .cse4)) is different from false [2024-11-08 22:43:54,142 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 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) (<= (+ |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|) 1) 2))) (* .cse0 .cse0))) .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-08 22:44:04,151 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 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) (<= (+ |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|) 1) 2))) (* .cse0 .cse0))) .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-08 22:44:15,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|)) (.cse0 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0)) (.cse3 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and .cse0 (<= .cse1 (let ((.cse2 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (* .cse2 .cse2))) .cse3)) (not (and (= .cse1 (let ((.cse4 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse4 .cse4))) .cse0 .cse3)) (<= c_~counter~0 2) .cse3 (= (+ (* |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