./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3 --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 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:48:29,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:48:29,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:48:29,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:48:29,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:48:29,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:48:29,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:48:29,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:48:29,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:48:29,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:48:29,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:48:29,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:48:29,352 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:48:29,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:48:29,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:29,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:48:29,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:48:29,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:48:29,354 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:48:29,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:48:29,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3 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 -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-11-25 04:48:29,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:48:29,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:48:29,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:48:29,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:48:29,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:48:29,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-25 04:48:32,566 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/data/1c2ffadbf/a04d72cd78634caeb77aa8274256ef05/FLAGbe5aaa416 [2024-11-25 04:48:32,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:48:32,854 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-25 04:48:32,883 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/data/1c2ffadbf/a04d72cd78634caeb77aa8274256ef05/FLAGbe5aaa416 [2024-11-25 04:48:33,133 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/data/1c2ffadbf/a04d72cd78634caeb77aa8274256ef05 [2024-11-25 04:48:33,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:48:33,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:48:33,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:33,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:48:33,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:48:33,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9046e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33, skipping insertion in model container [2024-11-25 04:48:33,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:48:33,336 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_79959884-840d-4c50-bcf7-124c5cee0eda/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-11-25 04:48:33,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:33,371 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:48:33,379 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_79959884-840d-4c50-bcf7-124c5cee0eda/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c[535,548] [2024-11-25 04:48:33,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:33,402 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:48:33,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33 WrapperNode [2024-11-25 04:48:33,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:33,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:33,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:48:33,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:48:33,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,438 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-25 04:48:33,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:33,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:48:33,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:48:33,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:48:33,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:48:33,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:48:33,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:48:33,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:48:33,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:48:33,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:48:33,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79959884-840d-4c50-bcf7-124c5cee0eda/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:48:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:48:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-25 04:48:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-25 04:48:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:48:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:48:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:48:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-25 04:48:33,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-25 04:48:33,596 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:48:33,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:48:33,807 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-25 04:48:33,807 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:48:33,849 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:48:33,854 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-25 04:48:33,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:33 BoogieIcfgContainer [2024-11-25 04:48:33,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:48:33,855 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:48:33,856 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:48:33,867 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:48:33,867 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:33" (1/1) ... [2024-11-25 04:48:33,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:48:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-11-25 04:48:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-11-25 04:48:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:48:33,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:34,128 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-25 04:48:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-11-25 04:48:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-25 04:48:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:48:34,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:48:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:34,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-25 04:48:34,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:48:34,628 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-25 04:48:37,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:48:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2024-11-25 04:48:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2024-11-25 04:48:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:48:37,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:37,274 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-25 04:48:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-11-25 04:48:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-11-25 04:48:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 04:48:37,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:39,271 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-25 04:48:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 35 states and 55 transitions. [2024-11-25 04:48:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-11-25 04:48:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:48:42,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:42,241 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-25 04:48:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 58 transitions. [2024-11-25 04:48:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2024-11-25 04:48:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 04:48:42,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:42,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:42,520 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-25 04:49:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 42 states and 67 transitions. [2024-11-25 04:49:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2024-11-25 04:49:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 04:49:05,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:05,776 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-25 04:49:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-11-25 04:49:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-11-25 04:49:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 04:49:05,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:05,972 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-25 04:49:15,474 WARN L286 SmtUtils]: Spent 9.42s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:49:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 45 states and 71 transitions. [2024-11-25 04:49:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 71 transitions. [2024-11-25 04:49:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 04:49:15,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:15,931 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-25 04:49:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 49 states and 80 transitions. [2024-11-25 04:49:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 80 transitions. [2024-11-25 04:49:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:49:40,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:40,657 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-25 04:49:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 51 states and 84 transitions. [2024-11-25 04:49:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2024-11-25 04:49:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:49:48,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:48,876 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-25 04:50:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 59 states and 99 transitions. [2024-11-25 04:50:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 99 transitions. [2024-11-25 04:50:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 04:50:14,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 04:50:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-25 04:50:14,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 04:50:30,513 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-25 04:50:54,068 WARN L286 SmtUtils]: Spent 10.44s 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-25 04:51:38,870 WARN L286 SmtUtils]: Spent 9.35s 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-25 04:52:02,969 WARN L286 SmtUtils]: Spent 6.08s 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-25 04:52:32,785 WARN L286 SmtUtils]: Spent 20.06s 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-25 04:53:02,467 WARN L286 SmtUtils]: Spent 10.03s 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-25 04:53:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:53:18,810 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-25 04:53:21,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:53:29,225 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 04:53:36,020 WARN L286 SmtUtils]: Spent 5.70s 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-25 04:53:48,516 WARN L286 SmtUtils]: Spent 6.36s 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-25 04:54:27,832 WARN L286 SmtUtils]: Spent 5.69s 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-25 04:55:45,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:55:46,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:55:52,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 04:56:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:56:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 68 states and 122 transitions. [2024-11-25 04:56:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 122 transitions. [2024-11-25 04:56:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:56:00,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:56:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:56:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:56:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:58:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:58:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 72 states and 134 transitions. [2024-11-25 04:58:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 134 transitions. [2024-11-25 04:58:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:58:52,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:58:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:58:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:58:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:58:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:58:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 74 states and 138 transitions. [2024-11-25 04:58:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 138 transitions. [2024-11-25 04:58:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:58:56,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:58:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:58:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:58:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:59:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:59:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 76 states and 145 transitions. [2024-11-25 04:59:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 145 transitions. [2024-11-25 04:59:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 04:59:15,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:59:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:59:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:59:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:59:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:59:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 80 states and 154 transitions. [2024-11-25 04:59:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 154 transitions. [2024-11-25 04:59:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 04:59:55,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:59:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:59:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:59:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 05:02:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:02:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 82 states and 155 transitions. [2024-11-25 05:02:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 155 transitions. [2024-11-25 05:02:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 05:02:00,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:02:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:02:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:02:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 05:02:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:02:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 82 states and 154 transitions. [2024-11-25 05:02:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 154 transitions. [2024-11-25 05:02:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 05:02:03,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:02:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:02:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 05:02:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:02:03,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-25 05:02:03,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 05:02:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 4 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 05:02:39,091 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-25 05:02:49,099 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-25 05:02:59,106 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-25 05:03:09,116 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-25 05:03:21,497 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-25 05:03:31,504 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-25 05:03:41,512 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