./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-11-15 23:55:11,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:11,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:11,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:11,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:11,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:11,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:11,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:11,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:11,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:11,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:11,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:11,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:11,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:11,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:11,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:11,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:11,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:11,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:11,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:11,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:11,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:11,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:11,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:11,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:11,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:11,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:11,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:11,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:11,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:11,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:11,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:11,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:11,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:11,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:11,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:11,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:11,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:11,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:11,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:11,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:11,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:55:11,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:11,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:11,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:11,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:11,760 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:11,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:11,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:11,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:11,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:11,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:11,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:55:11,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:55:11,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:55:11,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:11,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:11,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:11,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:55:11,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:11,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:11,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:55:11,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:55:11,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:55:11,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:11,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:55:11,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:55:11,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:11,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:55:11,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:55:11,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer 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 -> Automizer 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 -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2019-11-15 23:55:11,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:11,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:11,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:11,818 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:11,818 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:11,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-15 23:55:11,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/data/0a2fc7042/ec7bec6dc3ec431fb8d5d55149252d54/FLAG6628390e1 [2019-11-15 23:55:12,340 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:12,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-15 23:55:12,350 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/data/0a2fc7042/ec7bec6dc3ec431fb8d5d55149252d54/FLAG6628390e1 [2019-11-15 23:55:12,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/data/0a2fc7042/ec7bec6dc3ec431fb8d5d55149252d54 [2019-11-15 23:55:12,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:12,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:12,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:12,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:12,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:12,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:12" (1/1) ... [2019-11-15 23:55:12,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce3cbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:12, skipping insertion in model container [2019-11-15 23:55:12,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:12" (1/1) ... [2019-11-15 23:55:12,630 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:12,696 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:13,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:13,088 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:13,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:13,240 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:13,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13 WrapperNode [2019-11-15 23:55:13,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:13,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:13,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:13,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:13,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:13,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:13,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:13,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:13,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... [2019-11-15 23:55:13,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:13,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:13,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:13,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:13,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-11-15 23:55:13,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:13,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:14,665 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:14,665 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:55:14,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:14 BoogieIcfgContainer [2019-11-15 23:55:14,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:14,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:55:14,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:55:14,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:55:14,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:55:12" (1/3) ... [2019-11-15 23:55:14,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4325d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:14, skipping insertion in model container [2019-11-15 23:55:14,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:13" (2/3) ... [2019-11-15 23:55:14,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4325d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:14, skipping insertion in model container [2019-11-15 23:55:14,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:14" (3/3) ... [2019-11-15 23:55:14,681 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-15 23:55:14,689 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:55:14,696 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:55:14,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:55:14,740 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:55:14,741 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:55:14,741 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:55:14,741 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:14,741 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:14,741 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:55:14,742 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:14,742 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:55:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2019-11-15 23:55:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:55:14,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:14,773 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:14,775 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2019-11-15 23:55:14,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:14,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773861846] [2019-11-15 23:55:14,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:14,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:14,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:15,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773861846] [2019-11-15 23:55:15,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:15,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:15,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156090831] [2019-11-15 23:55:15,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:15,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:15,376 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 4 states. [2019-11-15 23:55:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:15,548 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2019-11-15 23:55:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:15,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 23:55:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:15,567 INFO L225 Difference]: With dead ends: 714 [2019-11-15 23:55:15,567 INFO L226 Difference]: Without dead ends: 470 [2019-11-15 23:55:15,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-15 23:55:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-11-15 23:55:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-15 23:55:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2019-11-15 23:55:15,661 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2019-11-15 23:55:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:15,662 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2019-11-15 23:55:15,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2019-11-15 23:55:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 23:55:15,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:15,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:15,671 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2019-11-15 23:55:15,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794059865] [2019-11-15 23:55:15,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:15,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794059865] [2019-11-15 23:55:15,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:15,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:15,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242883974] [2019-11-15 23:55:15,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:15,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:15,791 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand 3 states. [2019-11-15 23:55:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:15,838 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2019-11-15 23:55:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:15,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-15 23:55:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:15,845 INFO L225 Difference]: With dead ends: 1366 [2019-11-15 23:55:15,845 INFO L226 Difference]: Without dead ends: 926 [2019-11-15 23:55:15,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-15 23:55:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2019-11-15 23:55:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-15 23:55:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2019-11-15 23:55:15,914 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2019-11-15 23:55:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:15,916 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2019-11-15 23:55:15,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2019-11-15 23:55:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:55:15,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:15,928 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:15,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2019-11-15 23:55:15,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766316964] [2019-11-15 23:55:15,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766316964] [2019-11-15 23:55:16,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:16,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618601650] [2019-11-15 23:55:16,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:16,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,096 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand 3 states. [2019-11-15 23:55:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,160 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2019-11-15 23:55:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:16,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 23:55:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,165 INFO L225 Difference]: With dead ends: 977 [2019-11-15 23:55:16,165 INFO L226 Difference]: Without dead ends: 634 [2019-11-15 23:55:16,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-15 23:55:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2019-11-15 23:55:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-15 23:55:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2019-11-15 23:55:16,196 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2019-11-15 23:55:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:16,197 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2019-11-15 23:55:16,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2019-11-15 23:55:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:55:16,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:16,199 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:16,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,199 INFO L82 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2019-11-15 23:55:16,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196451338] [2019-11-15 23:55:16,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196451338] [2019-11-15 23:55:16,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:16,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934889997] [2019-11-15 23:55:16,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:16,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:16,330 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand 4 states. [2019-11-15 23:55:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,383 INFO L93 Difference]: Finished difference Result 1222 states and 1849 transitions. [2019-11-15 23:55:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:16,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 23:55:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,388 INFO L225 Difference]: With dead ends: 1222 [2019-11-15 23:55:16,389 INFO L226 Difference]: Without dead ends: 618 [2019-11-15 23:55:16,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-15 23:55:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2019-11-15 23:55:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-15 23:55:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 932 transitions. [2019-11-15 23:55:16,420 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 932 transitions. Word has length 103 [2019-11-15 23:55:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:16,421 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 932 transitions. [2019-11-15 23:55:16,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 932 transitions. [2019-11-15 23:55:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:55:16,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:16,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:16,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1648361287, now seen corresponding path program 1 times [2019-11-15 23:55:16,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628739534] [2019-11-15 23:55:16,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628739534] [2019-11-15 23:55:16,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:16,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858988364] [2019-11-15 23:55:16,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:16,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:16,580 INFO L87 Difference]: Start difference. First operand 617 states and 932 transitions. Second operand 4 states. [2019-11-15 23:55:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,642 INFO L93 Difference]: Finished difference Result 1225 states and 1851 transitions. [2019-11-15 23:55:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:16,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 23:55:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,647 INFO L225 Difference]: With dead ends: 1225 [2019-11-15 23:55:16,647 INFO L226 Difference]: Without dead ends: 615 [2019-11-15 23:55:16,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-15 23:55:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-11-15 23:55:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-11-15 23:55:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 928 transitions. [2019-11-15 23:55:16,685 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 928 transitions. Word has length 103 [2019-11-15 23:55:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:16,685 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 928 transitions. [2019-11-15 23:55:16,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 928 transitions. [2019-11-15 23:55:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:55:16,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:16,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:16,687 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash 101799940, now seen corresponding path program 1 times [2019-11-15 23:55:16,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352640596] [2019-11-15 23:55:16,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352640596] [2019-11-15 23:55:16,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:16,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481317518] [2019-11-15 23:55:16,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:16,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,776 INFO L87 Difference]: Start difference. First operand 615 states and 928 transitions. Second operand 3 states. [2019-11-15 23:55:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,848 INFO L93 Difference]: Finished difference Result 1334 states and 2036 transitions. [2019-11-15 23:55:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:16,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 23:55:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,856 INFO L225 Difference]: With dead ends: 1334 [2019-11-15 23:55:16,856 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 23:55:16,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 23:55:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-11-15 23:55:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-15 23:55:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1352 transitions. [2019-11-15 23:55:16,903 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1352 transitions. Word has length 103 [2019-11-15 23:55:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:16,903 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1352 transitions. [2019-11-15 23:55:16,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1352 transitions. [2019-11-15 23:55:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 23:55:16,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:16,908 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:16,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2115732183, now seen corresponding path program 1 times [2019-11-15 23:55:16,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244433880] [2019-11-15 23:55:16,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244433880] [2019-11-15 23:55:16,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:16,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639587799] [2019-11-15 23:55:16,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:16,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:16,984 INFO L87 Difference]: Start difference. First operand 907 states and 1352 transitions. Second operand 3 states. [2019-11-15 23:55:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:17,069 INFO L93 Difference]: Finished difference Result 1976 states and 3062 transitions. [2019-11-15 23:55:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:17,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 23:55:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:17,078 INFO L225 Difference]: With dead ends: 1976 [2019-11-15 23:55:17,078 INFO L226 Difference]: Without dead ends: 1335 [2019-11-15 23:55:17,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-11-15 23:55:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1291. [2019-11-15 23:55:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-11-15 23:55:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1975 transitions. [2019-11-15 23:55:17,178 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1975 transitions. Word has length 105 [2019-11-15 23:55:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:17,179 INFO L462 AbstractCegarLoop]: Abstraction has 1291 states and 1975 transitions. [2019-11-15 23:55:17,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1975 transitions. [2019-11-15 23:55:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:55:17,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:17,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:17,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -602590006, now seen corresponding path program 1 times [2019-11-15 23:55:17,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:17,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374174316] [2019-11-15 23:55:17,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:17,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:17,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:17,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374174316] [2019-11-15 23:55:17,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:17,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:17,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033640125] [2019-11-15 23:55:17,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:17,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:17,288 INFO L87 Difference]: Start difference. First operand 1291 states and 1975 transitions. Second operand 5 states. [2019-11-15 23:55:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:17,661 INFO L93 Difference]: Finished difference Result 3370 states and 5282 transitions. [2019-11-15 23:55:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:17,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-15 23:55:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:17,675 INFO L225 Difference]: With dead ends: 3370 [2019-11-15 23:55:17,676 INFO L226 Difference]: Without dead ends: 2255 [2019-11-15 23:55:17,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-11-15 23:55:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2253. [2019-11-15 23:55:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-11-15 23:55:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3503 transitions. [2019-11-15 23:55:17,809 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3503 transitions. Word has length 106 [2019-11-15 23:55:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:17,810 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 3503 transitions. [2019-11-15 23:55:17,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3503 transitions. [2019-11-15 23:55:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:55:17,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:17,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:17,812 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash -404241499, now seen corresponding path program 1 times [2019-11-15 23:55:17,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:17,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969078280] [2019-11-15 23:55:17,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:17,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:17,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:17,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969078280] [2019-11-15 23:55:17,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:17,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:17,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688521296] [2019-11-15 23:55:17,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:17,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:17,932 INFO L87 Difference]: Start difference. First operand 2253 states and 3503 transitions. Second operand 4 states. [2019-11-15 23:55:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:18,191 INFO L93 Difference]: Finished difference Result 5816 states and 9062 transitions. [2019-11-15 23:55:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:18,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 23:55:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:18,211 INFO L225 Difference]: With dead ends: 5816 [2019-11-15 23:55:18,212 INFO L226 Difference]: Without dead ends: 3590 [2019-11-15 23:55:18,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-11-15 23:55:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-11-15 23:55:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-15 23:55:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5552 transitions. [2019-11-15 23:55:18,475 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5552 transitions. Word has length 106 [2019-11-15 23:55:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:18,476 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5552 transitions. [2019-11-15 23:55:18,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5552 transitions. [2019-11-15 23:55:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 23:55:18,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:18,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:18,485 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1846587040, now seen corresponding path program 1 times [2019-11-15 23:55:18,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:18,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866420115] [2019-11-15 23:55:18,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866420115] [2019-11-15 23:55:18,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:18,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:18,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89251522] [2019-11-15 23:55:18,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:18,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:18,550 INFO L87 Difference]: Start difference. First operand 3588 states and 5552 transitions. Second operand 3 states. [2019-11-15 23:55:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:18,880 INFO L93 Difference]: Finished difference Result 8744 states and 13633 transitions. [2019-11-15 23:55:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:18,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-15 23:55:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:18,911 INFO L225 Difference]: With dead ends: 8744 [2019-11-15 23:55:18,911 INFO L226 Difference]: Without dead ends: 5528 [2019-11-15 23:55:18,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-11-15 23:55:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5526. [2019-11-15 23:55:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2019-11-15 23:55:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8479 transitions. [2019-11-15 23:55:19,312 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8479 transitions. Word has length 108 [2019-11-15 23:55:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:19,312 INFO L462 AbstractCegarLoop]: Abstraction has 5526 states and 8479 transitions. [2019-11-15 23:55:19,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8479 transitions. [2019-11-15 23:55:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 23:55:19,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:19,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:19,316 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash 224725848, now seen corresponding path program 1 times [2019-11-15 23:55:19,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:19,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182224854] [2019-11-15 23:55:19,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:19,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:19,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:19,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182224854] [2019-11-15 23:55:19,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:19,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:19,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691397677] [2019-11-15 23:55:19,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:19,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:19,367 INFO L87 Difference]: Start difference. First operand 5526 states and 8479 transitions. Second operand 3 states. [2019-11-15 23:55:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:19,854 INFO L93 Difference]: Finished difference Result 14566 states and 22766 transitions. [2019-11-15 23:55:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-15 23:55:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:19,919 INFO L225 Difference]: With dead ends: 14566 [2019-11-15 23:55:19,919 INFO L226 Difference]: Without dead ends: 9372 [2019-11-15 23:55:19,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2019-11-15 23:55:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8962. [2019-11-15 23:55:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2019-11-15 23:55:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13974 transitions. [2019-11-15 23:55:20,594 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 13974 transitions. Word has length 110 [2019-11-15 23:55:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 8962 states and 13974 transitions. [2019-11-15 23:55:20,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 13974 transitions. [2019-11-15 23:55:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 23:55:20,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:20,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:20,598 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1189364322, now seen corresponding path program 1 times [2019-11-15 23:55:20,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:20,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712823011] [2019-11-15 23:55:20,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:20,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:20,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:20,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712823011] [2019-11-15 23:55:20,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:20,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:20,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976797560] [2019-11-15 23:55:20,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:20,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:20,752 INFO L87 Difference]: Start difference. First operand 8962 states and 13974 transitions. Second operand 4 states. [2019-11-15 23:55:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:21,661 INFO L93 Difference]: Finished difference Result 25027 states and 38954 transitions. [2019-11-15 23:55:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:21,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-15 23:55:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:21,698 INFO L225 Difference]: With dead ends: 25027 [2019-11-15 23:55:21,698 INFO L226 Difference]: Without dead ends: 16104 [2019-11-15 23:55:21,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-11-15 23:55:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-11-15 23:55:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-11-15 23:55:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24827 transitions. [2019-11-15 23:55:22,800 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24827 transitions. Word has length 111 [2019-11-15 23:55:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:22,800 INFO L462 AbstractCegarLoop]: Abstraction has 16102 states and 24827 transitions. [2019-11-15 23:55:22,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24827 transitions. [2019-11-15 23:55:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 23:55:22,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:22,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:22,806 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2128482264, now seen corresponding path program 1 times [2019-11-15 23:55:22,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:22,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687920363] [2019-11-15 23:55:22,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:22,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:22,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:22,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687920363] [2019-11-15 23:55:22,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:22,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:22,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983600429] [2019-11-15 23:55:22,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:22,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:22,845 INFO L87 Difference]: Start difference. First operand 16102 states and 24827 transitions. Second operand 3 states. [2019-11-15 23:55:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:24,052 INFO L93 Difference]: Finished difference Result 48114 states and 74234 transitions. [2019-11-15 23:55:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:24,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-15 23:55:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:24,129 INFO L225 Difference]: With dead ends: 48114 [2019-11-15 23:55:24,130 INFO L226 Difference]: Without dead ends: 32117 [2019-11-15 23:55:24,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32117 states. [2019-11-15 23:55:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32117 to 16108. [2019-11-15 23:55:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16108 states. [2019-11-15 23:55:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16108 states to 16108 states and 24833 transitions. [2019-11-15 23:55:25,107 INFO L78 Accepts]: Start accepts. Automaton has 16108 states and 24833 transitions. Word has length 112 [2019-11-15 23:55:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:25,108 INFO L462 AbstractCegarLoop]: Abstraction has 16108 states and 24833 transitions. [2019-11-15 23:55:25,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 16108 states and 24833 transitions. [2019-11-15 23:55:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 23:55:25,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:25,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:25,114 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1621970129, now seen corresponding path program 1 times [2019-11-15 23:55:25,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:25,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053610062] [2019-11-15 23:55:25,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:25,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053610062] [2019-11-15 23:55:25,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:25,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:25,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739726286] [2019-11-15 23:55:25,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:25,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:25,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:25,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:25,206 INFO L87 Difference]: Start difference. First operand 16108 states and 24833 transitions. Second operand 3 states. [2019-11-15 23:55:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:26,661 INFO L93 Difference]: Finished difference Result 41746 states and 64349 transitions. [2019-11-15 23:55:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:26,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-15 23:55:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:26,720 INFO L225 Difference]: With dead ends: 41746 [2019-11-15 23:55:26,720 INFO L226 Difference]: Without dead ends: 26384 [2019-11-15 23:55:26,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2019-11-15 23:55:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26382. [2019-11-15 23:55:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2019-11-15 23:55:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 40027 transitions. [2019-11-15 23:55:28,364 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 40027 transitions. Word has length 113 [2019-11-15 23:55:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:28,365 INFO L462 AbstractCegarLoop]: Abstraction has 26382 states and 40027 transitions. [2019-11-15 23:55:28,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 40027 transitions. [2019-11-15 23:55:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 23:55:28,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:28,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:28,373 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1799632340, now seen corresponding path program 1 times [2019-11-15 23:55:28,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:28,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251575133] [2019-11-15 23:55:28,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:28,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:28,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:28,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251575133] [2019-11-15 23:55:28,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:28,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:28,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665499793] [2019-11-15 23:55:28,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:28,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:28,477 INFO L87 Difference]: Start difference. First operand 26382 states and 40027 transitions. Second operand 4 states. [2019-11-15 23:55:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:29,619 INFO L93 Difference]: Finished difference Result 48995 states and 74626 transitions. [2019-11-15 23:55:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:29,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 23:55:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:29,653 INFO L225 Difference]: With dead ends: 48995 [2019-11-15 23:55:29,654 INFO L226 Difference]: Without dead ends: 23283 [2019-11-15 23:55:29,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-11-15 23:55:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23283. [2019-11-15 23:55:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23283 states. [2019-11-15 23:55:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23283 states to 23283 states and 35373 transitions. [2019-11-15 23:55:30,636 INFO L78 Accepts]: Start accepts. Automaton has 23283 states and 35373 transitions. Word has length 113 [2019-11-15 23:55:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:30,636 INFO L462 AbstractCegarLoop]: Abstraction has 23283 states and 35373 transitions. [2019-11-15 23:55:30,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23283 states and 35373 transitions. [2019-11-15 23:55:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:55:30,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:30,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:30,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash -812664826, now seen corresponding path program 1 times [2019-11-15 23:55:30,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:30,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299385977] [2019-11-15 23:55:30,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:30,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:30,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:30,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299385977] [2019-11-15 23:55:30,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:30,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:30,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059231157] [2019-11-15 23:55:30,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:30,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:30,764 INFO L87 Difference]: Start difference. First operand 23283 states and 35373 transitions. Second operand 4 states. [2019-11-15 23:55:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:31,905 INFO L93 Difference]: Finished difference Result 44591 states and 67806 transitions. [2019-11-15 23:55:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:31,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 23:55:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:31,929 INFO L225 Difference]: With dead ends: 44591 [2019-11-15 23:55:31,930 INFO L226 Difference]: Without dead ends: 21601 [2019-11-15 23:55:31,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21601 states. [2019-11-15 23:55:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21601 to 21559. [2019-11-15 23:55:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2019-11-15 23:55:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 32717 transitions. [2019-11-15 23:55:32,875 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 32717 transitions. Word has length 116 [2019-11-15 23:55:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 21559 states and 32717 transitions. [2019-11-15 23:55:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 32717 transitions. [2019-11-15 23:55:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 23:55:32,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:32,881 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:32,881 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash -929354459, now seen corresponding path program 1 times [2019-11-15 23:55:32,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:32,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987215945] [2019-11-15 23:55:32,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:33,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987215945] [2019-11-15 23:55:33,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:33,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:33,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052860252] [2019-11-15 23:55:33,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:33,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:33,014 INFO L87 Difference]: Start difference. First operand 21559 states and 32717 transitions. Second operand 4 states. [2019-11-15 23:55:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:34,394 INFO L93 Difference]: Finished difference Result 43127 states and 65445 transitions. [2019-11-15 23:55:34,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:34,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 23:55:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:34,412 INFO L225 Difference]: With dead ends: 43127 [2019-11-15 23:55:34,413 INFO L226 Difference]: Without dead ends: 21723 [2019-11-15 23:55:34,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21723 states. [2019-11-15 23:55:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21723 to 21661. [2019-11-15 23:55:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21661 states. [2019-11-15 23:55:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21661 states to 21661 states and 32820 transitions. [2019-11-15 23:55:35,349 INFO L78 Accepts]: Start accepts. Automaton has 21661 states and 32820 transitions. Word has length 118 [2019-11-15 23:55:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:35,350 INFO L462 AbstractCegarLoop]: Abstraction has 21661 states and 32820 transitions. [2019-11-15 23:55:35,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21661 states and 32820 transitions. [2019-11-15 23:55:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 23:55:35,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:35,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:35,353 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1710773055, now seen corresponding path program 1 times [2019-11-15 23:55:35,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:35,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453387639] [2019-11-15 23:55:35,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:35,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:35,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:35,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453387639] [2019-11-15 23:55:35,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:35,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:35,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125260872] [2019-11-15 23:55:35,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:35,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:35,399 INFO L87 Difference]: Start difference. First operand 21661 states and 32820 transitions. Second operand 3 states. [2019-11-15 23:55:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:37,244 INFO L93 Difference]: Finished difference Result 58875 states and 89429 transitions. [2019-11-15 23:55:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:37,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-15 23:55:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:37,287 INFO L225 Difference]: With dead ends: 58875 [2019-11-15 23:55:37,287 INFO L226 Difference]: Without dead ends: 43115 [2019-11-15 23:55:37,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43115 states. [2019-11-15 23:55:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43115 to 21671. [2019-11-15 23:55:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21671 states. [2019-11-15 23:55:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21671 states to 21671 states and 32830 transitions. [2019-11-15 23:55:38,393 INFO L78 Accepts]: Start accepts. Automaton has 21671 states and 32830 transitions. Word has length 119 [2019-11-15 23:55:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:38,393 INFO L462 AbstractCegarLoop]: Abstraction has 21671 states and 32830 transitions. [2019-11-15 23:55:38,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21671 states and 32830 transitions. [2019-11-15 23:55:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 23:55:38,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:38,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:38,397 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -993915098, now seen corresponding path program 1 times [2019-11-15 23:55:38,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:38,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854599989] [2019-11-15 23:55:38,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:38,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854599989] [2019-11-15 23:55:38,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:38,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:38,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76122802] [2019-11-15 23:55:38,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:38,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:38,490 INFO L87 Difference]: Start difference. First operand 21671 states and 32830 transitions. Second operand 4 states. [2019-11-15 23:55:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:39,979 INFO L93 Difference]: Finished difference Result 39799 states and 60385 transitions. [2019-11-15 23:55:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:39,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 23:55:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:40,002 INFO L225 Difference]: With dead ends: 39799 [2019-11-15 23:55:40,002 INFO L226 Difference]: Without dead ends: 21671 [2019-11-15 23:55:40,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-11-15 23:55:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21666. [2019-11-15 23:55:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-11-15 23:55:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 32817 transitions. [2019-11-15 23:55:41,124 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 32817 transitions. Word has length 120 [2019-11-15 23:55:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:41,124 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 32817 transitions. [2019-11-15 23:55:41,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 32817 transitions. [2019-11-15 23:55:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 23:55:41,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:41,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:41,128 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:41,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1394285578, now seen corresponding path program 1 times [2019-11-15 23:55:41,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:41,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450772008] [2019-11-15 23:55:41,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:41,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:41,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:41,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450772008] [2019-11-15 23:55:41,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:41,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:41,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826572751] [2019-11-15 23:55:41,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:41,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:41,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:41,274 INFO L87 Difference]: Start difference. First operand 21666 states and 32817 transitions. Second operand 5 states. [2019-11-15 23:55:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:42,531 INFO L93 Difference]: Finished difference Result 35788 states and 54278 transitions. [2019-11-15 23:55:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:42,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-15 23:55:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:42,551 INFO L225 Difference]: With dead ends: 35788 [2019-11-15 23:55:42,551 INFO L226 Difference]: Without dead ends: 20187 [2019-11-15 23:55:42,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2019-11-15 23:55:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 20030. [2019-11-15 23:55:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2019-11-15 23:55:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 30264 transitions. [2019-11-15 23:55:43,718 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 30264 transitions. Word has length 120 [2019-11-15 23:55:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:43,718 INFO L462 AbstractCegarLoop]: Abstraction has 20030 states and 30264 transitions. [2019-11-15 23:55:43,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 30264 transitions. [2019-11-15 23:55:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:55:43,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:43,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:43,722 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2019-11-15 23:55:43,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:43,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891000215] [2019-11-15 23:55:43,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:44,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891000215] [2019-11-15 23:55:44,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:44,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:55:44,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302685329] [2019-11-15 23:55:44,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:55:44,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:55:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:55:44,035 INFO L87 Difference]: Start difference. First operand 20030 states and 30264 transitions. Second operand 12 states. [2019-11-15 23:55:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:48,150 INFO L93 Difference]: Finished difference Result 73114 states and 112944 transitions. [2019-11-15 23:55:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:55:48,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-11-15 23:55:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:48,224 INFO L225 Difference]: With dead ends: 73114 [2019-11-15 23:55:48,224 INFO L226 Difference]: Without dead ends: 55192 [2019-11-15 23:55:48,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:55:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55192 states. [2019-11-15 23:55:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55192 to 46889. [2019-11-15 23:55:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46889 states. [2019-11-15 23:55:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46889 states to 46889 states and 71849 transitions. [2019-11-15 23:55:51,306 INFO L78 Accepts]: Start accepts. Automaton has 46889 states and 71849 transitions. Word has length 122 [2019-11-15 23:55:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:51,306 INFO L462 AbstractCegarLoop]: Abstraction has 46889 states and 71849 transitions. [2019-11-15 23:55:51,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:55:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46889 states and 71849 transitions. [2019-11-15 23:55:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:55:51,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:51,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:51,311 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1778231621, now seen corresponding path program 1 times [2019-11-15 23:55:51,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:51,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057180657] [2019-11-15 23:55:51,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:51,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:51,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:51,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057180657] [2019-11-15 23:55:51,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:51,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:51,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227762120] [2019-11-15 23:55:51,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:51,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:51,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:51,378 INFO L87 Difference]: Start difference. First operand 46889 states and 71849 transitions. Second operand 3 states. [2019-11-15 23:55:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:57,002 INFO L93 Difference]: Finished difference Result 133443 states and 207185 transitions. [2019-11-15 23:55:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:57,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 23:55:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:57,118 INFO L225 Difference]: With dead ends: 133443 [2019-11-15 23:55:57,118 INFO L226 Difference]: Without dead ends: 90157 [2019-11-15 23:55:57,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90157 states. [2019-11-15 23:56:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90157 to 90083. [2019-11-15 23:56:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90083 states. [2019-11-15 23:56:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90083 states to 90083 states and 137239 transitions. [2019-11-15 23:56:03,234 INFO L78 Accepts]: Start accepts. Automaton has 90083 states and 137239 transitions. Word has length 122 [2019-11-15 23:56:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:03,234 INFO L462 AbstractCegarLoop]: Abstraction has 90083 states and 137239 transitions. [2019-11-15 23:56:03,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 90083 states and 137239 transitions. [2019-11-15 23:56:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:56:03,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:03,239 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:03,240 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2019-11-15 23:56:03,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:03,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938731789] [2019-11-15 23:56:03,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:03,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938731789] [2019-11-15 23:56:03,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:03,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:56:03,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339928971] [2019-11-15 23:56:03,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:56:03,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:56:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:03,425 INFO L87 Difference]: Start difference. First operand 90083 states and 137239 transitions. Second operand 8 states. [2019-11-15 23:56:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:09,241 INFO L93 Difference]: Finished difference Result 176995 states and 270863 transitions. [2019-11-15 23:56:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:09,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-15 23:56:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:09,343 INFO L225 Difference]: With dead ends: 176995 [2019-11-15 23:56:09,344 INFO L226 Difference]: Without dead ends: 90085 [2019-11-15 23:56:09,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:56:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90085 states. [2019-11-15 23:56:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90085 to 54886. [2019-11-15 23:56:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54886 states. [2019-11-15 23:56:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54886 states to 54886 states and 82979 transitions. [2019-11-15 23:56:13,469 INFO L78 Accepts]: Start accepts. Automaton has 54886 states and 82979 transitions. Word has length 122 [2019-11-15 23:56:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:13,469 INFO L462 AbstractCegarLoop]: Abstraction has 54886 states and 82979 transitions. [2019-11-15 23:56:13,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:56:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 54886 states and 82979 transitions. [2019-11-15 23:56:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:56:13,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:13,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:13,474 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1976470388, now seen corresponding path program 1 times [2019-11-15 23:56:13,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:13,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815983397] [2019-11-15 23:56:13,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:13,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815983397] [2019-11-15 23:56:13,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:13,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:13,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449748572] [2019-11-15 23:56:13,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:56:13,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:13,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:56:13,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:56:13,607 INFO L87 Difference]: Start difference. First operand 54886 states and 82979 transitions. Second operand 6 states. [2019-11-15 23:56:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,720 INFO L93 Difference]: Finished difference Result 211808 states and 322091 transitions. [2019-11-15 23:56:25,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:56:25,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-11-15 23:56:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,926 INFO L225 Difference]: With dead ends: 211808 [2019-11-15 23:56:25,926 INFO L226 Difference]: Without dead ends: 157938 [2019-11-15 23:56:25,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157938 states. [2019-11-15 23:56:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157938 to 157934. [2019-11-15 23:56:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157934 states. [2019-11-15 23:56:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157934 states to 157934 states and 239573 transitions. [2019-11-15 23:56:37,135 INFO L78 Accepts]: Start accepts. Automaton has 157934 states and 239573 transitions. Word has length 122 [2019-11-15 23:56:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:37,135 INFO L462 AbstractCegarLoop]: Abstraction has 157934 states and 239573 transitions. [2019-11-15 23:56:37,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:56:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 157934 states and 239573 transitions. [2019-11-15 23:56:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:56:37,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:37,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:37,140 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1986267249, now seen corresponding path program 1 times [2019-11-15 23:56:37,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:37,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511761768] [2019-11-15 23:56:37,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:38,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511761768] [2019-11-15 23:56:38,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:38,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-15 23:56:38,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439428047] [2019-11-15 23:56:38,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:56:38,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:38,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:56:38,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:56:38,076 INFO L87 Difference]: Start difference. First operand 157934 states and 239573 transitions. Second operand 23 states. [2019-11-15 23:57:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:08,163 INFO L93 Difference]: Finished difference Result 455292 states and 691889 transitions. [2019-11-15 23:57:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:57:08,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-11-15 23:57:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:08,627 INFO L225 Difference]: With dead ends: 455292 [2019-11-15 23:57:08,627 INFO L226 Difference]: Without dead ends: 357294 [2019-11-15 23:57:08,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 23:57:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357294 states. [2019-11-15 23:57:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357294 to 210188. [2019-11-15 23:57:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210188 states. [2019-11-15 23:57:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210188 states to 210188 states and 319396 transitions. [2019-11-15 23:57:33,805 INFO L78 Accepts]: Start accepts. Automaton has 210188 states and 319396 transitions. Word has length 122 [2019-11-15 23:57:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:33,805 INFO L462 AbstractCegarLoop]: Abstraction has 210188 states and 319396 transitions. [2019-11-15 23:57:33,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:57:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 210188 states and 319396 transitions. [2019-11-15 23:57:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:57:33,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:33,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:33,812 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash -270948014, now seen corresponding path program 1 times [2019-11-15 23:57:33,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:33,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352211286] [2019-11-15 23:57:33,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:33,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:34,017 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:34,018 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:57:34,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:57:34 BoogieIcfgContainer [2019-11-15 23:57:34,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:57:34,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:34,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:34,242 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:34,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:14" (3/4) ... [2019-11-15 23:57:34,245 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:57:34,526 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d40cc406-b960-4191-884a-52cc7a6578b4/bin/uautomizer/witness.graphml [2019-11-15 23:57:34,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:34,528 INFO L168 Benchmark]: Toolchain (without parser) took 141919.40 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 939.3 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,529 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:34,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.48 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,530 INFO L168 Benchmark]: Boogie Preprocessor took 64.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,530 INFO L168 Benchmark]: RCFGBuilder took 1291.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,531 INFO L168 Benchmark]: TraceAbstraction took 139573.63 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,531 INFO L168 Benchmark]: Witness Printer took 284.59 ms. Allocated memory is still 6.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:34,533 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.48 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1291.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 139573.63 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 284.59 ms. Allocated memory is still 6.5 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L133] COND TRUE !(init__r121 == 0) [L135] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1759] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1761] COND TRUE !(ep23 == 0) [L1763] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1736] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1738] COND TRUE !(ep31 == 0) [L1740] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r231 == 0) [L150] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r311 == 0) [L155] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1667] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1669] COND TRUE !(ep12 == 0) [L1671] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE !(newmax1 == 0) [L256] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] COND TRUE p12_new == nomsg [L261] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L263] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE !(newmax2 == 0) [L307] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L308] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND TRUE p23_new == nomsg [L312] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L314] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L328] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L330] COND TRUE !(newmax3 == 0) [L332] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L333] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L335] COND TRUE p31_new == nomsg [L337] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L339] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE !(ep31 == 0) [L434] m1 = p31_old [L435] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. Result: UNSAFE, OverallTime: 139.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 73.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12137 SDtfs, 16617 SDslu, 18571 SDs, 0 SdLazy, 4029 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210188occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 229346 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2924 NumberOfCodeBlocks, 2924 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2777 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...