./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/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 8a7b4ef7a8affb897157388e19dfe5e9a45c805e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-08 23:50:33,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:50:33,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:50:33,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:50:33,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:50:33,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:50:33,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:50:33,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:50:33,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:50:33,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:50:33,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:50:33,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:50:33,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:50:33,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:50:33,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:50:33,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:50:33,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:50:33,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:50:33,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:50:33,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:50:33,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:50:33,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:50:33,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:50:33,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:50:33,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:50:33,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:50:33,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:50:33,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:50:33,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:50:33,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:50:33,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:50:33,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:50:33,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:50:33,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:50:33,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:50:33,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:50:33,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 23:50:33,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:50:33,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:50:33,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:50:33,913 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 23:50:33,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 23:50:33,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 23:50:33,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:50:33,913 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:50:33,914 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:50:33,915 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 23:50:33,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 23:50:33,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:50:33,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:50:33,916 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 23:50:33,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:50:33,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:50:33,916 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_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/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 -> 8a7b4ef7a8affb897157388e19dfe5e9a45c805e [2018-12-08 23:50:33,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:50:33,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:50:33,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:50:33,942 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:50:33,942 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:50:33,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 23:50:33,976 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/data/f8b8f125f/a6e96ebb4a1e4accbd1e25cc5bc32f59/FLAGcfa6a1c00 [2018-12-08 23:50:34,447 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:50:34,448 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 23:50:34,453 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/data/f8b8f125f/a6e96ebb4a1e4accbd1e25cc5bc32f59/FLAGcfa6a1c00 [2018-12-08 23:50:34,462 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/data/f8b8f125f/a6e96ebb4a1e4accbd1e25cc5bc32f59 [2018-12-08 23:50:34,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:50:34,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:50:34,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:50:34,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:50:34,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:50:34,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2648fef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34, skipping insertion in model container [2018-12-08 23:50:34,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:50:34,493 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:50:34,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:50:34,622 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:50:34,685 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:50:34,696 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:50:34,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34 WrapperNode [2018-12-08 23:50:34,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:50:34,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:50:34,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:50:34,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:50:34,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:50:34,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:50:34,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:50:34,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:50:34,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... [2018-12-08 23:50:34,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:50:34,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:50:34,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:50:34,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:50:34,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/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-12-08 23:50:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:50:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:50:36,237 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:50:36,237 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 23:50:36,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:36 BoogieIcfgContainer [2018-12-08 23:50:36,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:50:36,238 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 23:50:36,238 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 23:50:36,246 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 23:50:36,247 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:36" (1/1) ... [2018-12-08 23:50:36,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:50:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-08 23:50:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-08 23:50:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 23:50:36,278 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-08 23:50:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-08 23:50:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 23:50:36,588 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-08 23:50:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-08 23:50:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 23:50:36,855 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-08 23:50:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-08 23:50:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 23:50:37,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-08 23:50:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-08 23:50:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:50:37,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-08 23:50:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-08 23:50:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 23:50:38,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-08 23:50:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-08 23:50:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 23:50:39,205 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-08 23:50:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-08 23:50:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 23:50:39,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-08 23:50:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-08 23:50:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 23:50:39,428 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-08 23:50:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-08 23:50:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 23:50:40,794 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-08 23:50:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-08 23:50:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 23:50:41,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:47,460 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-08 23:50:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 77 states and 152 transitions. [2018-12-08 23:50:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 152 transitions. [2018-12-08 23:50:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:50:47,987 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:49,885 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-08 23:50:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 93 states and 190 transitions. [2018-12-08 23:50:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 190 transitions. [2018-12-08 23:50:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:50:54,752 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 94 states and 199 transitions. [2018-12-08 23:50:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 199 transitions. [2018-12-08 23:50:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:50:55,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:50:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 95 states and 200 transitions. [2018-12-08 23:50:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 200 transitions. [2018-12-08 23:50:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:50:55,600 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:50:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:50:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:56,264 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-08 23:51:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 112 states and 238 transitions. [2018-12-08 23:51:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 238 transitions. [2018-12-08 23:51:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:51:01,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 114 states and 246 transitions. [2018-12-08 23:51:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 246 transitions. [2018-12-08 23:51:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:51:02,636 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 116 states and 256 transitions. [2018-12-08 23:51:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 256 transitions. [2018-12-08 23:51:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:51:03,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:06,991 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-12-08 23:51:07,352 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-08 23:51:08,411 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-08 23:51:09,359 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-08 23:51:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 130 states and 289 transitions. [2018-12-08 23:51:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 289 transitions. [2018-12-08 23:51:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:51:12,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 132 states and 292 transitions. [2018-12-08 23:51:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 292 transitions. [2018-12-08 23:51:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:51:13,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 133 states and 296 transitions. [2018-12-08 23:51:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 296 transitions. [2018-12-08 23:51:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:51:14,371 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 135 states and 306 transitions. [2018-12-08 23:51:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 306 transitions. [2018-12-08 23:51:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:51:15,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:51:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:51:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:51:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 136 states and 309 transitions. [2018-12-08 23:51:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 309 transitions. [2018-12-08 23:51:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:51:16,186 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:51:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:16,654 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 23 iterations. [2018-12-08 23:51:16,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 11:51:16 ImpRootNode [2018-12-08 23:51:16,731 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 23:51:16,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:51:16,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:51:16,732 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:51:16,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:36" (3/4) ... [2018-12-08 23:51:16,734 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 23:51:16,796 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6896d5b5-1e62-4d5f-b716-1a64d3b707cb/bin-2019/ukojak/witness.graphml [2018-12-08 23:51:16,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:51:16,797 INFO L168 Benchmark]: Toolchain (without parser) took 42333.24 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 632.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 470.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,797 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:51:16,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:51:16,798 INFO L168 Benchmark]: Boogie Preprocessor took 21.08 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,798 INFO L168 Benchmark]: RCFGBuilder took 1490.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -42.2 MB). Peak memory consumption was 333.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,798 INFO L168 Benchmark]: CodeCheck took 40492.99 ms. Allocated memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: 403.2 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.8 MB). Peak memory consumption was 433.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,799 INFO L168 Benchmark]: Witness Printer took 65.04 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:16,800 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, 141 locations, 1 error locations. UNSAFE Result, 40.3s OverallTime, 23 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36924376 SDtfs, 14095338 SDslu, 13119376 SDs, 0 SdLazy, 105166104 SolverSat, 25513562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3933 GetRequests, 3321 SyntacticMatches, 182 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117398 ImplicationChecksByTransitivity, 37.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 79509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 24/72 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: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND TRUE \read(ep32) [L306] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND TRUE \read(r211) [L328] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND TRUE \read(r211) [L344] COND TRUE \read(ep13) [L345] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND TRUE \read(ep21) [L358] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=-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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=0, m2=-1, m3=3, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 1 [L144] COND TRUE (int )max1 == (int )id1 [L145] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND TRUE (int )m3 > (int )max3 [L232] max3 = m3 [L233] newmax = (_Bool)1 [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L515] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L542] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.08 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1490.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -42.2 MB). Peak memory consumption was 333.0 MB. Max. memory is 11.5 GB. * CodeCheck took 40492.99 ms. Allocated memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: 403.2 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.8 MB). Peak memory consumption was 433.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.04 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...