./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum20.i --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_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:15:53,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:15:53,393 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:15:53,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:15:53,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:15:53,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:15:53,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:15:53,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:15:53,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:15:53,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:15:53,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:15:53,417 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:15:53,417 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:15:53,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:15:53,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:15:53,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:15:53,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:15:53,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:15:53,418 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:15:53,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:15:53,418 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_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2024-12-06 01:15:53,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:15:53,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:15:53,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:15:53,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:15:53,625 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:15:53,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-12-06 01:15:56,243 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/data/9eb337509/a7e1a8652e3549148ff0c0fa5bc9a76e/FLAG7fb18b7c7 [2024-12-06 01:15:56,440 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:15:56,441 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-12-06 01:15:56,448 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/data/9eb337509/a7e1a8652e3549148ff0c0fa5bc9a76e/FLAG7fb18b7c7 [2024-12-06 01:15:56,799 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/data/9eb337509/a7e1a8652e3549148ff0c0fa5bc9a76e [2024-12-06 01:15:56,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:15:56,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:15:56,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:15:56,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:15:56,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:15:56,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:56,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541d373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56, skipping insertion in model container [2024-12-06 01:15:56,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:56,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:15:56,940 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_2a42c9c5-3dcc-489a-9144-0934e6e6876e/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-12-06 01:15:56,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:15:56,950 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:15:56,966 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_2a42c9c5-3dcc-489a-9144-0934e6e6876e/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-12-06 01:15:56,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:15:56,978 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:15:56,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56 WrapperNode [2024-12-06 01:15:56,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:15:56,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:15:56,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:15:56,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:15:56,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:56,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,003 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-12-06 01:15:57,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:15:57,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:15:57,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:15:57,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:15:57,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:15:57,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:15:57,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:15:57,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:15:57,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:56" (1/1) ... [2024-12-06 01:15:57,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:15:57,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:15:57,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:15:57,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:15:57,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 01:15:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-12-06 01:15:57,067 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-12-06 01:15:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 01:15:57,123 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:15:57,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:15:57,274 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-12-06 01:15:57,274 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:15:57,322 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:15:57,322 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-06 01:15:57,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:15:57 BoogieIcfgContainer [2024-12-06 01:15:57,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:15:57,324 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:15:57,324 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:15:57,333 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:15:57,333 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:15:57" (1/1) ... [2024-12-06 01:15:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:15:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2024-12-06 01:15:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-12-06 01:15:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:15:57,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:15:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2024-12-06 01:15:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-12-06 01:15:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 01:15:57,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:15:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2024-12-06 01:15:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-12-06 01:15:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:15:57,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:15:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2024-12-06 01:15:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2024-12-06 01:15:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 01:15:57,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:15:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2024-12-06 01:15:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-12-06 01:15:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:15:58,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2024-12-06 01:15:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2024-12-06 01:15:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 01:15:58,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2024-12-06 01:15:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2024-12-06 01:15:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 01:15:58,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2024-12-06 01:15:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2024-12-06 01:15:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 01:15:58,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2024-12-06 01:15:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2024-12-06 01:15:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 01:15:58,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 26 states and 36 transitions. [2024-12-06 01:15:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2024-12-06 01:15:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 01:15:59,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-12-06 01:15:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-12-06 01:15:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:15:59,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2024-12-06 01:15:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-12-06 01:15:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:15:59,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:15:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:15:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-12-06 01:15:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-12-06 01:15:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:15:59,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:15:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:15:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:15:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-12-06 01:16:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-12-06 01:16:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:16:00,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2024-12-06 01:16:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-12-06 01:16:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 01:16:00,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2024-12-06 01:16:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-12-06 01:16:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:16:00,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 33 states and 43 transitions. [2024-12-06 01:16:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-12-06 01:16:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:16:00,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-12-06 01:16:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-12-06 01:16:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 01:16:01,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 35 states and 45 transitions. [2024-12-06 01:16:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-12-06 01:16:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:16:01,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-12-06 01:16:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-12-06 01:16:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 01:16:01,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 37 states and 47 transitions. [2024-12-06 01:16:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-12-06 01:16:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-06 01:16:02,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2024-12-06 01:16:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-12-06 01:16:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-06 01:16:02,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2024-12-06 01:16:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-12-06 01:16:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 01:16:02,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2024-12-06 01:16:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-12-06 01:16:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 01:16:03,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 01:16:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 41 states and 50 transitions. [2024-12-06 01:16:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-12-06 01:16:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 01:16:03,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-12-06 01:16:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-12-06 01:16:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-12-06 01:16:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-06 01:16:03,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-12-06 01:16:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 43 states and 52 transitions. [2024-12-06 01:16:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-12-06 01:16:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-06 01:16:04,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-12-06 01:16:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 44 states and 53 transitions. [2024-12-06 01:16:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-12-06 01:16:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-06 01:16:04,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-12-06 01:16:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 45 states and 54 transitions. [2024-12-06 01:16:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-12-06 01:16:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-06 01:16:04,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-12-06 01:16:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 46 states and 55 transitions. [2024-12-06 01:16:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-12-06 01:16:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-06 01:16:05,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-12-06 01:16:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 47 states and 56 transitions. [2024-12-06 01:16:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-12-06 01:16:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-06 01:16:05,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:05,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-12-06 01:16:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2024-12-06 01:16:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-12-06 01:16:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-06 01:16:05,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2024-12-06 01:16:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 49 states and 58 transitions. [2024-12-06 01:16:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-12-06 01:16:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 01:16:06,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-12-06 01:16:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2024-12-06 01:16:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-12-06 01:16:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 01:16:06,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-12-06 01:16:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 51 states and 60 transitions. [2024-12-06 01:16:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-12-06 01:16:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:16:06,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-12-06 01:16:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 52 states and 61 transitions. [2024-12-06 01:16:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-12-06 01:16:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-06 01:16:07,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-12-06 01:16:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 53 states and 62 transitions. [2024-12-06 01:16:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-12-06 01:16:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 01:16:07,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 0 proven. 557 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-12-06 01:16:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 54 states and 63 transitions. [2024-12-06 01:16:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-12-06 01:16:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 01:16:08,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2024-12-06 01:16:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 55 states and 64 transitions. [2024-12-06 01:16:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-12-06 01:16:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:16:08,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-12-06 01:16:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-12-06 01:16:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-12-06 01:16:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 01:16:09,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 803 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2024-12-06 01:16:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-12-06 01:16:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-12-06 01:16:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 01:16:09,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 895 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2024-12-06 01:16:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-12-06 01:16:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-12-06 01:16:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:16:10,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2024-12-06 01:16:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 59 states and 67 transitions. [2024-12-06 01:16:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-12-06 01:16:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 01:16:10,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 60 states and 68 transitions. [2024-12-06 01:16:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-12-06 01:16:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 01:16:10,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 61 states and 69 transitions. [2024-12-06 01:16:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-12-06 01:16:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 01:16:11,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2179 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 62 states and 70 transitions. [2024-12-06 01:16:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-12-06 01:16:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:16:11,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2024-12-06 01:16:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-12-06 01:16:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 01:16:11,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 64 states and 72 transitions. [2024-12-06 01:16:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-12-06 01:16:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 01:16:12,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 65 states and 73 transitions. [2024-12-06 01:16:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-12-06 01:16:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:16:12,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 66 states and 74 transitions. [2024-12-06 01:16:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-12-06 01:16:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 01:16:13,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 67 states and 75 transitions. [2024-12-06 01:16:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-12-06 01:16:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 01:16:13,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 68 states and 76 transitions. [2024-12-06 01:16:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-12-06 01:16:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 01:16:14,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 69 states and 77 transitions. [2024-12-06 01:16:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-12-06 01:16:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 01:16:14,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 70 states and 78 transitions. [2024-12-06 01:16:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-12-06 01:16:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 01:16:14,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 71 states and 79 transitions. [2024-12-06 01:16:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-12-06 01:16:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 01:16:15,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 72 states and 80 transitions. [2024-12-06 01:16:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-12-06 01:16:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 01:16:16,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 73 states and 81 transitions. [2024-12-06 01:16:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-12-06 01:16:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 01:16:16,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 74 states and 82 transitions. [2024-12-06 01:16:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-12-06 01:16:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 01:16:17,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-12-06 01:16:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-12-06 01:16:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 01:16:17,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:17,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:16:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-12-06 01:16:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:16:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-12-06 01:16:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-12-06 01:16:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 01:16:18,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:16:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:16:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:16:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:16:26,731 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 01:16:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 01:16:34,451 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2024-12-06 01:16:34,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:16:34 ImpRootNode [2024-12-06 01:16:34,539 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:16:34,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:16:34,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:16:34,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:16:34,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:15:57" (3/4) ... [2024-12-06 01:16:34,541 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 01:16:34,636 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 177. [2024-12-06 01:16:34,743 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:16:34,744 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:16:34,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:16:34,745 INFO L158 Benchmark]: Toolchain (without parser) took 37943.19ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 92.2MB in the beginning and 709.8MB in the end (delta: -617.5MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,745 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:16:34,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.47ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.67ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,746 INFO L158 Benchmark]: Boogie Preprocessor took 19.02ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.6MB in the end (delta: 959.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:16:34,746 INFO L158 Benchmark]: RCFGBuilder took 299.65ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 63.4MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,747 INFO L158 Benchmark]: CodeCheck took 37215.50ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 63.2MB in the beginning and 730.2MB in the end (delta: -666.9MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,747 INFO L158 Benchmark]: Witness Printer took 204.19ms. Allocated memory is still 872.4MB. Free memory was 730.2MB in the beginning and 709.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 01:16:34,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2417 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 767 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6964 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7768 IncrementalHoareTripleChecker+Invalid, 14732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6964 mSolverCounterUnsat, 767 mSDtfsCounter, 7768 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17997 GetRequests, 17272 SyntacticMatches, 495 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21313 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 4150 NumberOfCodeBlocks, 4150 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3972 ConstructedInterpolants, 0 QuantifiedInterpolants, 5192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 47241/56821 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}] [L17] COND FALSE !(i < 20) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=22, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=21, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-1, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-19, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-33, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-42, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-10, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-13, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-19, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-2, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=22, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=21, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-1, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-19, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-33, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-42, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-10, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-13, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-19, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=-2, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-2, ret=-2, temp=-4, x={3:0}] [L54] COND FALSE !(i<20 -1) [L57] x[20 -1] = temp VAL [ret2=-2, ret=-2, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-1, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=-23, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=-41, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=-55, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-64, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-32, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-35, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-41, x={3:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-45, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=-2, ret=-2, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.47ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.7MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.67ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.02ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.6MB in the end (delta: 959.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.65ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 63.4MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 37215.50ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 63.2MB in the beginning and 730.2MB in the end (delta: -666.9MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 204.19ms. Allocated memory is still 872.4MB. Free memory was 730.2MB in the beginning and 709.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 01:16:34,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a42c9c5-3dcc-489a-9144-0934e6e6876e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE