./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00d162608be697d65baff4581155da4ea0225a1e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:36:18,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:36:18,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:36:18,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:36:18,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:36:18,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:36:18,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:36:18,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:36:18,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:36:18,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:36:18,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:36:18,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:36:18,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:36:18,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:36:18,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:36:18,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:36:18,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:36:18,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:36:18,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:36:18,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:36:18,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:36:18,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:36:18,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:36:18,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:36:18,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:36:18,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:36:18,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:36:18,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:36:18,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:36:18,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:36:18,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:36:18,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:36:18,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:36:18,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:36:18,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:36:18,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:36:18,124 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:36:18,134 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:36:18,134 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:36:18,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:36:18,135 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:36:18,135 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:36:18,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:36:18,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:36:18,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:36:18,137 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:36:18,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:36:18,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:36:18,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:36:18,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:36:18,139 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> 00d162608be697d65baff4581155da4ea0225a1e [2018-11-10 04:36:18,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:36:18,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:36:18,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:36:18,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:36:18,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:36:18,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-10 04:36:18,219 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/data/1e543b398/b0b84e096407480397683f4785bf78fa/FLAG24d77b12c [2018-11-10 04:36:18,649 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:36:18,649 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-11-10 04:36:18,655 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/data/1e543b398/b0b84e096407480397683f4785bf78fa/FLAG24d77b12c [2018-11-10 04:36:18,664 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/data/1e543b398/b0b84e096407480397683f4785bf78fa [2018-11-10 04:36:18,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:36:18,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:36:18,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:36:18,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:36:18,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:36:18,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:18,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18, skipping insertion in model container [2018-11-10 04:36:18,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:18,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:36:18,713 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:36:18,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:36:18,863 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:36:18,898 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:36:18,912 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:36:18,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18 WrapperNode [2018-11-10 04:36:18,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:36:18,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:36:18,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:36:18,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:36:18,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:18,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:18,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:36:18,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:36:18,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:36:18,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:36:18,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:18,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... [2018-11-10 04:36:19,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:36:19,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:36:19,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:36:19,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:36:19,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:36:19,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:36:19,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:36:20,585 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:36:20,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:20 BoogieIcfgContainer [2018-11-10 04:36:20,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:36:20,586 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:36:20,587 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:36:20,593 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:36:20,593 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:20" (1/1) ... [2018-11-10 04:36:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:36:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 04:36:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 04:36:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 04:36:20,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-10 04:36:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-10 04:36:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 04:36:21,011 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-10 04:36:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-10 04:36:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 04:36:21,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-10 04:36:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-10 04:36:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 04:36:21,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-10 04:36:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-10 04:36:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:36:22,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-10 04:36:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-10 04:36:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 04:36:22,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-10 04:36:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-10 04:36:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 04:36:23,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-10 04:36:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-10 04:36:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 04:36:23,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-10 04:36:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-10 04:36:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 04:36:23,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-10 04:36:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-10 04:36:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 04:36:25,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-10 04:36:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-10 04:36:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:36:25,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 86 states and 138 transitions. [2018-11-10 04:36:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-10 04:36:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:36:28,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 105 states and 169 transitions. [2018-11-10 04:36:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 169 transitions. [2018-11-10 04:36:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:36:32,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 106 states and 171 transitions. [2018-11-10 04:36:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 171 transitions. [2018-11-10 04:36:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:36:32,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 126 states and 204 transitions. [2018-11-10 04:36:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 204 transitions. [2018-11-10 04:36:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:36:36,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 128 states and 208 transitions. [2018-11-10 04:36:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 208 transitions. [2018-11-10 04:36:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:36:36,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 143 states and 235 transitions. [2018-11-10 04:36:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 235 transitions. [2018-11-10 04:36:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:36:39,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 144 states and 237 transitions. [2018-11-10 04:36:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 237 transitions. [2018-11-10 04:36:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:36:39,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 145 states and 238 transitions. [2018-11-10 04:36:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 238 transitions. [2018-11-10 04:36:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:36:40,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 146 states and 239 transitions. [2018-11-10 04:36:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 239 transitions. [2018-11-10 04:36:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:36:40,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 147 states and 244 transitions. [2018-11-10 04:36:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 244 transitions. [2018-11-10 04:36:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:36:41,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 169 states and 276 transitions. [2018-11-10 04:36:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 276 transitions. [2018-11-10 04:36:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:36:46,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 174 states and 285 transitions. [2018-11-10 04:36:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 285 transitions. [2018-11-10 04:36:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:36:48,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 183 states and 304 transitions. [2018-11-10 04:36:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 304 transitions. [2018-11-10 04:36:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 04:36:52,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 198 states and 352 transitions. [2018-11-10 04:36:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 352 transitions. [2018-11-10 04:36:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:36:58,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 211 states and 383 transitions. [2018-11-10 04:37:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 383 transitions. [2018-11-10 04:37:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:37:03,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 213 states and 386 transitions. [2018-11-10 04:37:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 386 transitions. [2018-11-10 04:37:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:37:04,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 226 states and 413 transitions. [2018-11-10 04:37:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 413 transitions. [2018-11-10 04:37:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:37:11,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 229 states and 421 transitions. [2018-11-10 04:37:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 421 transitions. [2018-11-10 04:37:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 04:37:12,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 240 states and 443 transitions. [2018-11-10 04:37:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 443 transitions. [2018-11-10 04:37:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 04:37:17,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 243 states and 454 transitions. [2018-11-10 04:37:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 454 transitions. [2018-11-10 04:37:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:37:18,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 247 states and 464 transitions. [2018-11-10 04:37:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 464 transitions. [2018-11-10 04:37:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:37:23,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 253 states and 480 transitions. [2018-11-10 04:37:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 480 transitions. [2018-11-10 04:37:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:37:26,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 254 states and 481 transitions. [2018-11-10 04:37:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 481 transitions. [2018-11-10 04:37:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:37:26,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 258 states and 494 transitions. [2018-11-10 04:37:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 494 transitions. [2018-11-10 04:37:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:28,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 265 states and 513 transitions. [2018-11-10 04:37:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 513 transitions. [2018-11-10 04:37:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:31,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 266 states and 515 transitions. [2018-11-10 04:37:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 515 transitions. [2018-11-10 04:37:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:32,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 267 states and 516 transitions. [2018-11-10 04:37:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 516 transitions. [2018-11-10 04:37:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:33,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 268 states and 517 transitions. [2018-11-10 04:37:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 517 transitions. [2018-11-10 04:37:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:34,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 272 states and 527 transitions. [2018-11-10 04:37:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 527 transitions. [2018-11-10 04:37:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:37:36,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 274 states and 532 transitions. [2018-11-10 04:37:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 532 transitions. [2018-11-10 04:37:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:36,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 276 states and 538 transitions. [2018-11-10 04:37:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 538 transitions. [2018-11-10 04:37:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:39,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 278 states and 542 transitions. [2018-11-10 04:37:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 542 transitions. [2018-11-10 04:37:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:39,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 282 states and 555 transitions. [2018-11-10 04:37:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 555 transitions. [2018-11-10 04:37:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:41,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 284 states and 558 transitions. [2018-11-10 04:37:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 558 transitions. [2018-11-10 04:37:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:43,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 285 states and 559 transitions. [2018-11-10 04:37:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 559 transitions. [2018-11-10 04:37:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:37:43,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 289 states and 572 transitions. [2018-11-10 04:37:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 572 transitions. [2018-11-10 04:37:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 04:37:45,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:46,501 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2018-11-10 04:37:46,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:37:46 ImpRootNode [2018-11-10 04:37:46,590 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:37:46,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:37:46,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:37:46,590 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:37:46,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:20" (3/4) ... [2018-11-10 04:37:46,593 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:37:46,684 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_741ad743-2637-4c7a-98d7-04c15a55de4c/bin-2019/ukojak/witness.graphml [2018-11-10 04:37:46,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:37:46,685 INFO L168 Benchmark]: Toolchain (without parser) took 88017.72 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 960.3 MB in the beginning and 1.9 GB in the end (delta: -985.2 MB). Peak memory consumption was 241.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,685 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:37:46,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 941.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,686 INFO L168 Benchmark]: Boogie Preprocessor took 26.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,686 INFO L168 Benchmark]: RCFGBuilder took 1569.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 77.0 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,686 INFO L168 Benchmark]: CodeCheck took 86003.39 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -918.4 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,687 INFO L168 Benchmark]: Witness Printer took 94.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:46,688 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 136 locations, 1 error locations. UNSAFE Result, 85.8s OverallTime, 47 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 780104080 SDslu, 1469433108 SDs, 0 SdLazy, 1565715788 SolverSat, 1127404740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13740 GetRequests, 12026 SyntacticMatches, 862 SemanticMatches, 852 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488192 ImplicationChecksByTransitivity, 78.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1464 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1366 ConstructedInterpolants, 0 QuantifiedInterpolants, 529580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 171/899 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 610]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L564] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND TRUE \read(r121) [L285] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND TRUE \read(r121) [L301] COND TRUE \read(ep23) [L302] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND TRUE \read(r231) [L314] COND TRUE \read(ep31) [L315] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] RET return (tmp___5); [L564] EXPR init() [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L153] COND FALSE !(\read(ep13)) [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=-1, m3=3, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND TRUE (int )m2 > (int )max2 [L176] max2 = m2 [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND TRUE (int )m2 > (int )max2 [L183] max2 = m2 [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L153] COND FALSE !(\read(ep13)) [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] st1 = (char)1 [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND FALSE !((int )max2 == (int )id2) [L190] nl2 = (char)1 [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L610] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 941.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1569.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 77.0 MB). Peak memory consumption was 266.0 MB. Max. memory is 11.5 GB. * CodeCheck took 86003.39 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -918.4 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. * Witness Printer took 94.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...