./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.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_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/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 b3efd85eaecafa9f5850339d4919cc79d62d9539 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-01 18:14:34,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:14:34,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:14:34,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:14:34,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:14:34,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:14:34,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:14:34,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:14:34,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:14:34,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:14:34,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:14:34,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:14:34,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:14:34,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:14:34,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:14:34,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:14:34,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:14:34,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:14:34,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:14:34,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:14:34,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:14:34,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:14:34,833 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:14:34,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:14:34,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:14:34,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:14:34,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:14:34,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:14:34,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:14:34,836 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:14:34,836 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:14:34,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:14:34,837 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:14:34,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:14:34,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:14:34,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:14:34,838 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 18:14:34,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:14:34,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:14:34,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 18:14:34,845 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 18:14:34,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:14:34,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 18:14:34,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 18:14:34,847 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 18:14:34,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 18:14:34,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 18:14:34,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:14:34,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 18:14:34,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 18:14:34,848 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 18:14:34,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 18:14:34,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 18:14:34,848 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_298ff124-59cd-406a-a5e8-da6ac94b3c2a/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 -> b3efd85eaecafa9f5850339d4919cc79d62d9539 [2018-12-01 18:14:34,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:14:34,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:14:34,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:14:34,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:14:34,874 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:14:34,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-01 18:14:34,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/data/0459f4470/d02636e759704816bbb2f3e66bf96e36/FLAGc2581a964 [2018-12-01 18:14:35,355 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:14:35,355 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-01 18:14:35,360 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/data/0459f4470/d02636e759704816bbb2f3e66bf96e36/FLAGc2581a964 [2018-12-01 18:14:35,368 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/data/0459f4470/d02636e759704816bbb2f3e66bf96e36 [2018-12-01 18:14:35,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:14:35,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:14:35,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:14:35,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:14:35,373 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:14:35,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc82c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35, skipping insertion in model container [2018-12-01 18:14:35,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:14:35,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:14:35,517 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:14:35,522 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:14:35,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:14:35,606 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:14:35,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35 WrapperNode [2018-12-01 18:14:35,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:14:35,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:14:35,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:14:35,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:14:35,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:14:35,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:14:35,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:14:35,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:14:35,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... [2018-12-01 18:14:35,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:14:35,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:14:35,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:14:35,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:14:35,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:14:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/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-01 18:14:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:14:35,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:14:36,989 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:14:36,990 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 18:14:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:14:36 BoogieIcfgContainer [2018-12-01 18:14:36,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:14:36,990 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 18:14:36,990 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 18:14:36,996 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 18:14:36,996 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:14:36" (1/1) ... [2018-12-01 18:14:37,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:14:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-01 18:14:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-01 18:14:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 18:14:37,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:37,229 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-01 18:14:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-01 18:14:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-01 18:14:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 18:14:37,282 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:37,368 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-01 18:14:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-01 18:14:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-01 18:14:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 18:14:37,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:37,601 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-01 18:14:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-01 18:14:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-01 18:14:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 18:14:37,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:37,897 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-01 18:14:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-01 18:14:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-01 18:14:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 18:14:38,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:38,433 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-01 18:14:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-01 18:14:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-01 18:14:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 18:14:38,923 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:39,031 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-01 18:14:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-01 18:14:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-01 18:14:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 18:14:39,613 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:39,684 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-01 18:14:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-01 18:14:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-01 18:14:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 18:14:39,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:39,851 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-01 18:14:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-01 18:14:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-01 18:14:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 18:14:39,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:40,014 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-01 18:14:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-01 18:14:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-01 18:14:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 18:14:41,682 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:41,834 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-01 18:14:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-01 18:14:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-01 18:14:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 18:14:41,979 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:42,566 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-01 18:14:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 77 states and 143 transitions. [2018-12-01 18:14:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2018-12-01 18:14:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 18:14:45,053 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:45,384 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-01 18:14:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 94 states and 178 transitions. [2018-12-01 18:14:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 178 transitions. [2018-12-01 18:14:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 18:14:49,564 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:49,903 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-01 18:14:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 112 states and 215 transitions. [2018-12-01 18:14:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 215 transitions. [2018-12-01 18:14:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 18:14:54,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:54,656 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-01 18:14:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:14:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 113 states and 216 transitions. [2018-12-01 18:14:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 216 transitions. [2018-12-01 18:14:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 18:14:54,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:14:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:14:55,365 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-01 18:15:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 127 states and 245 transitions. [2018-12-01 18:15:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 245 transitions. [2018-12-01 18:15:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 18:15:00,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:00,397 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-01 18:15:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 128 states and 250 transitions. [2018-12-01 18:15:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 250 transitions. [2018-12-01 18:15:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 18:15:00,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:00,681 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-01 18:15:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 130 states and 253 transitions. [2018-12-01 18:15:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 253 transitions. [2018-12-01 18:15:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 18:15:01,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:01,188 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-01 18:15:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 131 states and 254 transitions. [2018-12-01 18:15:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 254 transitions. [2018-12-01 18:15:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 18:15:01,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:07,425 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-01 18:15:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 151 states and 293 transitions. [2018-12-01 18:15:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 293 transitions. [2018-12-01 18:15:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 18:15:11,609 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 156 states and 302 transitions. [2018-12-01 18:15:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 302 transitions. [2018-12-01 18:15:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 18:15:13,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:17,534 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-01 18:15:18,966 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-01 18:15:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 164 states and 322 transitions. [2018-12-01 18:15:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 322 transitions. [2018-12-01 18:15:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 18:15:21,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:27,666 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-12-01 18:15:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 192 states and 397 transitions. [2018-12-01 18:15:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 397 transitions. [2018-12-01 18:15:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 18:15:38,165 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 197 states and 408 transitions. [2018-12-01 18:15:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 408 transitions. [2018-12-01 18:15:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 18:15:40,373 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 212 states and 447 transitions. [2018-12-01 18:15:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 447 transitions. [2018-12-01 18:15:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 18:15:51,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:15:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:15:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 218 states and 466 transitions. [2018-12-01 18:15:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 466 transitions. [2018-12-01 18:15:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 18:15:55,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:15:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:15:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 229 states and 490 transitions. [2018-12-01 18:16:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 490 transitions. [2018-12-01 18:16:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 18:16:05,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 231 states and 496 transitions. [2018-12-01 18:16:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 496 transitions. [2018-12-01 18:16:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 18:16:09,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 232 states and 499 transitions. [2018-12-01 18:16:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 499 transitions. [2018-12-01 18:16:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 18:16:09,910 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 233 states and 503 transitions. [2018-12-01 18:16:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 503 transitions. [2018-12-01 18:16:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 18:16:10,514 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 247 states and 541 transitions. [2018-12-01 18:16:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 541 transitions. [2018-12-01 18:16:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 18:16:24,541 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 253 states and 553 transitions. [2018-12-01 18:16:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 553 transitions. [2018-12-01 18:16:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 18:16:29,761 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 255 states and 564 transitions. [2018-12-01 18:16:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 564 transitions. [2018-12-01 18:16:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 18:16:31,049 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 256 states and 567 transitions. [2018-12-01 18:16:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 567 transitions. [2018-12-01 18:16:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 18:16:31,634 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 264 states and 592 transitions. [2018-12-01 18:16:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 592 transitions. [2018-12-01 18:16:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 18:16:43,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 267 states and 604 transitions. [2018-12-01 18:16:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 604 transitions. [2018-12-01 18:16:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 18:16:44,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 268 states and 605 transitions. [2018-12-01 18:16:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 605 transitions. [2018-12-01 18:16:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 18:16:45,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 271 states and 617 transitions. [2018-12-01 18:16:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 617 transitions. [2018-12-01 18:16:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 18:16:47,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 278 states and 638 transitions. [2018-12-01 18:16:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 638 transitions. [2018-12-01 18:16:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 18:16:53,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 279 states and 639 transitions. [2018-12-01 18:16:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 639 transitions. [2018-12-01 18:16:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 18:16:54,209 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 283 states and 650 transitions. [2018-12-01 18:16:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 650 transitions. [2018-12-01 18:16:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 18:16:56,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 286 states and 660 transitions. [2018-12-01 18:16:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 660 transitions. [2018-12-01 18:16:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 18:16:59,088 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:16:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:16:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:16:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 287 states and 665 transitions. [2018-12-01 18:16:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 665 transitions. [2018-12-01 18:16:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 18:16:59,752 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:16:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:17:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:17:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:17:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 294 states and 689 transitions. [2018-12-01 18:17:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 689 transitions. [2018-12-01 18:17:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 18:17:10,292 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:17:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:17:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:17:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:17:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 295 states and 692 transitions. [2018-12-01 18:17:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 692 transitions. [2018-12-01 18:17:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 18:17:12,269 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:17:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:17:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:17:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:17:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 299 states and 706 transitions. [2018-12-01 18:17:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 706 transitions. [2018-12-01 18:17:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 18:17:16,458 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:17:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:17:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:17:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 18:17:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 302 states and 717 transitions. [2018-12-01 18:17:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 717 transitions. [2018-12-01 18:17:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 18:17:19,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 18:17:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:17:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:17:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:17:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:17:29,665 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2018-12-01 18:17:29,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:17:29 ImpRootNode [2018-12-01 18:17:29,770 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 18:17:29,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:17:29,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:17:29,770 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:17:29,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:14:36" (3/4) ... [2018-12-01 18:17:29,772 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 18:17:29,858 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_298ff124-59cd-406a-a5e8-da6ac94b3c2a/bin-2019/ukojak/witness.graphml [2018-12-01 18:17:29,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:17:29,858 INFO L168 Benchmark]: Toolchain (without parser) took 174488.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 952.2 MB in the beginning and 968.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 176.9 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.95 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: Boogie Preprocessor took 20.85 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: RCFGBuilder took 1333.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.6 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,859 INFO L168 Benchmark]: CodeCheck took 172779.45 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -38.3 MB). Free memory was 1.2 GB in the beginning and 991.1 MB in the end (delta: 228.1 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,860 INFO L168 Benchmark]: Witness Printer took 87.97 ms. Allocated memory is still 1.2 GB. Free memory was 991.1 MB in the beginning and 968.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-01 18:17:29,861 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, 129 locations, 1 error locations. UNSAFE Result, 172.6s OverallTime, 47 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1373367804 SDtfs, 624244782 SDslu, -1122837184 SDs, 0 SdLazy, 1878628434 SolverSat, -16969708 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14328 GetRequests, 12611 SyntacticMatches, 719 SemanticMatches, 998 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599320 ImplicationChecksByTransitivity, 154.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 458441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 156/827 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: 601]: 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] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND TRUE \read(r231) [L304] COND TRUE \read(ep31) [L305] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND TRUE \read(r311) [L343] COND TRUE \read(ep12) [L344] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] return (tmp___5); [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 1 [L146] COND TRUE \read(ep12) [L147] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, 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=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=5, m2=4, m3=4, max1=4, max2=5, max3=6, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND FALSE !((int )r1 < 1) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, 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=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, 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 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=4, m3=5, max1=6, max2=5, max3=6, 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=5, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] nl1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L517] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=6, m1=6, m2=-1, m3=5, max1=6, max2=5, max3=6, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.95 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.85 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1333.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.6 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. * CodeCheck took 172779.45 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -38.3 MB). Free memory was 1.2 GB in the beginning and 991.1 MB in the end (delta: 228.1 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. * Witness Printer took 87.97 ms. Allocated memory is still 1.2 GB. Free memory was 991.1 MB in the beginning and 968.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...