./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:05:30,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:05:30,287 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:05:30,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:05:30,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:05:30,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:05:30,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:05:30,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:05:30,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:05:30,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:05:30,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:05:30,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:05:30,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:05:30,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:05:30,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:05:30,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:05:30,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:05:30,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:05:30,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:05:30,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:05:30,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:05:30,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:05:30,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:05:30,351 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:05:30,352 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:05:30,352 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:05:30,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:05:30,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:30,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:05:30,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:05:30,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:05:30,353 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:05:30,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:05:30,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 [2024-11-08 22:05:30,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:05:30,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:05:30,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:05:30,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:05:30,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:05:30,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c Unable to find full path for "g++" [2024-11-08 22:05:32,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:05:33,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:05:33,017 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2024-11-08 22:05:33,024 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/data/7050a9513/9c8aab55c5ed4f4ca219402080952670/FLAGc5570c393 [2024-11-08 22:05:33,040 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/data/7050a9513/9c8aab55c5ed4f4ca219402080952670 [2024-11-08 22:05:33,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:05:33,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:05:33,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:33,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:05:33,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:05:33,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1d208d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33, skipping insertion in model container [2024-11-08 22:05:33,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:05:33,335 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_448a1778-4bbc-45f6-a14c-81bbd0688c13/sv-benchmarks/c/recursive-simple/sum_25x0-2.c[481,494] [2024-11-08 22:05:33,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:33,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:05:33,364 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_448a1778-4bbc-45f6-a14c-81bbd0688c13/sv-benchmarks/c/recursive-simple/sum_25x0-2.c[481,494] [2024-11-08 22:05:33,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:33,384 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:05:33,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33 WrapperNode [2024-11-08 22:05:33,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:33,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:33,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:05:33,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:05:33,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,422 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-08 22:05:33,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:33,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:05:33,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:05:33,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:05:33,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:05:33,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:05:33,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:05:33,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:05:33,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:05:33,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:05:33,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:05:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:05:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:05:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:05:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-08 22:05:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-08 22:05:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:05:33,581 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:05:33,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:05:33,679 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:05:33,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:05:33,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:05:33,702 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 22:05:33,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:33 BoogieIcfgContainer [2024-11-08 22:05:33,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:05:33,704 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:05:33,704 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:05:33,716 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:05:33,716 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:05:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2024-11-08 22:05:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-08 22:05:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:05:33,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 18 transitions. [2024-11-08 22:05:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-08 22:05:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:05:34,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:05:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 23 transitions. [2024-11-08 22:05:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-08 22:05:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:05:34,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:05:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 22 states and 29 transitions. [2024-11-08 22:05:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-11-08 22:05:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:05:34,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 22:05:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 25 states and 36 transitions. [2024-11-08 22:05:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-08 22:05:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 22:05:35,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 22:05:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 28 states and 44 transitions. [2024-11-08 22:05:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2024-11-08 22:05:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:05:35,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 22:05:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 31 states and 53 transitions. [2024-11-08 22:05:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2024-11-08 22:05:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:05:35,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 22:05:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 34 states and 63 transitions. [2024-11-08 22:05:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. [2024-11-08 22:05:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 22:05:36,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 22:05:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 37 states and 74 transitions. [2024-11-08 22:05:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2024-11-08 22:05:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 22:05:36,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 22:05:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 40 states and 86 transitions. [2024-11-08 22:05:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 86 transitions. [2024-11-08 22:05:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 22:05:37,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-08 22:05:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 43 states and 99 transitions. [2024-11-08 22:05:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 99 transitions. [2024-11-08 22:05:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 22:05:37,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 22:05:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 46 states and 113 transitions. [2024-11-08 22:05:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2024-11-08 22:05:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:05:38,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-08 22:05:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 49 states and 128 transitions. [2024-11-08 22:05:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 128 transitions. [2024-11-08 22:05:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 22:05:39,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 22:05:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 52 states and 144 transitions. [2024-11-08 22:05:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 144 transitions. [2024-11-08 22:05:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 22:05:39,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 22:05:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 55 states and 161 transitions. [2024-11-08 22:05:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 161 transitions. [2024-11-08 22:05:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 22:05:40,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 22:05:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 58 states and 179 transitions. [2024-11-08 22:05:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 179 transitions. [2024-11-08 22:05:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 22:05:41,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-08 22:05:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 61 states and 198 transitions. [2024-11-08 22:05:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 198 transitions. [2024-11-08 22:05:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 22:05:42,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-08 22:05:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 64 states and 218 transitions. [2024-11-08 22:05:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 218 transitions. [2024-11-08 22:05:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 22:05:43,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-08 22:05:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 67 states and 239 transitions. [2024-11-08 22:05:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 239 transitions. [2024-11-08 22:05:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 22:05:44,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-08 22:05:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 70 states and 261 transitions. [2024-11-08 22:05:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 261 transitions. [2024-11-08 22:05:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 22:05:45,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-08 22:05:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 73 states and 284 transitions. [2024-11-08 22:05:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 284 transitions. [2024-11-08 22:05:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 22:05:46,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 22:05:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 76 states and 308 transitions. [2024-11-08 22:05:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 308 transitions. [2024-11-08 22:05:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 22:05:47,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-08 22:05:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 79 states and 333 transitions. [2024-11-08 22:05:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 333 transitions. [2024-11-08 22:05:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 22:05:48,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-08 22:05:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 82 states and 359 transitions. [2024-11-08 22:05:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 359 transitions. [2024-11-08 22:05:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:05:49,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-08 22:05:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 85 states and 386 transitions. [2024-11-08 22:05:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 386 transitions. [2024-11-08 22:05:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 22:05:51,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-11-08 22:05:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 88 states and 414 transitions. [2024-11-08 22:05:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 414 transitions. [2024-11-08 22:05:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 22:05:52,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:05:52,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:05:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:05:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:05:52,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:05:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:05:52,755 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 26 iterations. [2024-11-08 22:05:52,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:05:52 ImpRootNode [2024-11-08 22:05:52,849 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:05:52,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:05:52,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:05:52,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:05:52,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:33" (3/4) ... [2024-11-08 22:05:52,854 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:05:52,989 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:05:52,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:05:52,990 INFO L158 Benchmark]: Toolchain (without parser) took 19945.53ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 130.2MB in the beginning and 187.5MB in the end (delta: -57.3MB). Peak memory consumption was 196.9MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,990 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:05:52,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.99ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 135.2MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 133.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,991 INFO L158 Benchmark]: Boogie Preprocessor took 18.42ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:05:52,991 INFO L158 Benchmark]: RCFGBuilder took 260.65ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 122.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,995 INFO L158 Benchmark]: CodeCheck took 19145.86ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 122.7MB in the beginning and 191.7MB in the end (delta: -69.1MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,995 INFO L158 Benchmark]: Witness Printer took 139.07ms. Allocated memory is still 423.6MB. Free memory was 191.7MB in the beginning and 187.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:05:52,997 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, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 26, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2074 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 2872 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2524 mSDsCounter, 1277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14517 IncrementalHoareTripleChecker+Invalid, 15794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1277 mSolverCounterUnsat, 348 mSDtfsCounter, 14517 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37043 GetRequests, 35418 SyntacticMatches, 1523 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3683 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 5200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/15000 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 25; [L15] int b = 0; VAL [a=25, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=25, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.99ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 135.2MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 133.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.42ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.65ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 122.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * CodeCheck took 19145.86ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 122.7MB in the beginning and 191.7MB in the end (delta: -69.1MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 139.07ms. Allocated memory is still 423.6MB. Free memory was 191.7MB in the beginning and 187.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:05:53,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_448a1778-4bbc-45f6-a14c-81bbd0688c13/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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