./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7f647c6008697302f06b1d1dda080bf4ccd77afb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:37:34,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:37:34,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:37:34,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:37:34,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:37:34,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:37:34,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:37:34,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:37:34,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:37:34,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:37:34,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:37:34,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:37:34,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:37:34,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:37:34,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:37:34,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:37:34,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:37:34,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:37:34,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:37:34,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:37:34,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:37:34,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:37:34,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:37:34,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:37:34,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:37:34,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:37:34,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:37:34,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:37:34,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:37:34,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:37:34,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:37:34,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:37:34,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:37:34,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:37:34,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:37:34,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:37:34,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:37:34,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:37:34,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:37:34,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:37:34,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:37:34,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:37:34,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:37:34,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:37:34,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:37:34,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:37:34,699 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:37:34,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:37:34,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:37:34,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:37:34,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:37:34,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:37:34,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:37:34,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:37:34,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:37:34,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:37:34,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:37:34,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:37:34,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:37:34,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:37:34,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:37:34,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:37:34,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:37:34,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:37:34,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:37:34,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:37:34,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:37:34,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:37:34,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:37:34,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:37:34,705 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7f647c6008697302f06b1d1dda080bf4ccd77afb [2019-11-28 00:37:35,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:37:35,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:37:35,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:37:35,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:37:35,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:37:35,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-28 00:37:35,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3665fa662/9c5988a3f8aa4c799f3ec72fd119fc87/FLAG6d83c22a9 [2019-11-28 00:37:35,638 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:37:35,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-28 00:37:35,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3665fa662/9c5988a3f8aa4c799f3ec72fd119fc87/FLAG6d83c22a9 [2019-11-28 00:37:35,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3665fa662/9c5988a3f8aa4c799f3ec72fd119fc87 [2019-11-28 00:37:35,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:37:35,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:37:35,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:37:35,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:37:35,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:37:35,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:37:35" (1/1) ... [2019-11-28 00:37:35,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16570061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:35, skipping insertion in model container [2019-11-28 00:37:35,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:37:35" (1/1) ... [2019-11-28 00:37:36,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:37:36,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:37:36,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:37:36,542 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:37:36,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:37:36,688 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:37:36,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36 WrapperNode [2019-11-28 00:37:36,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:37:36,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:37:36,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:37:36,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:37:36,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:37:36,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:37:36,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:37:36,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:37:36,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... [2019-11-28 00:37:36,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:37:36,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:37:36,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:37:36,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:37:36,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 00:37:36,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:37:36,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:37:38,260 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:37:38,260 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:37:38,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:37:38 BoogieIcfgContainer [2019-11-28 00:37:38,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:37:38,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:37:38,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:37:38,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:37:38,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:37:35" (1/3) ... [2019-11-28 00:37:38,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7006c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:37:38, skipping insertion in model container [2019-11-28 00:37:38,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:36" (2/3) ... [2019-11-28 00:37:38,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7006c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:37:38, skipping insertion in model container [2019-11-28 00:37:38,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:37:38" (3/3) ... [2019-11-28 00:37:38,272 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-28 00:37:38,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:37:38,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:37:38,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:37:38,338 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:37:38,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:37:38,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:37:38,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:37:38,339 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:37:38,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:37:38,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:37:38,340 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:37:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2019-11-28 00:37:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 00:37:38,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:38,374 INFO L410 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] [2019-11-28 00:37:38,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1207420229, now seen corresponding path program 1 times [2019-11-28 00:37:38,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:38,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740871842] [2019-11-28 00:37:38,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:38,885 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-28 00:37:38,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740871842] [2019-11-28 00:37:38,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:38,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:38,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797269726] [2019-11-28 00:37:38,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:38,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:38,917 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 3 states. [2019-11-28 00:37:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:39,088 INFO L93 Difference]: Finished difference Result 432 states and 754 transitions. [2019-11-28 00:37:39,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:39,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 00:37:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:39,124 INFO L225 Difference]: With dead ends: 432 [2019-11-28 00:37:39,125 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 00:37:39,132 INFO L630 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-28 00:37:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 00:37:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2019-11-28 00:37:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-28 00:37:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 488 transitions. [2019-11-28 00:37:39,253 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 488 transitions. Word has length 94 [2019-11-28 00:37:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:39,255 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 488 transitions. [2019-11-28 00:37:39,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 488 transitions. [2019-11-28 00:37:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 00:37:39,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:39,260 INFO L410 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] [2019-11-28 00:37:39,261 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1721200426, now seen corresponding path program 1 times [2019-11-28 00:37:39,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:39,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621717210] [2019-11-28 00:37:39,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:39,575 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-28 00:37:39,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621717210] [2019-11-28 00:37:39,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:39,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:39,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24619787] [2019-11-28 00:37:39,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:39,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:39,581 INFO L87 Difference]: Start difference. First operand 319 states and 488 transitions. Second operand 4 states. [2019-11-28 00:37:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:39,725 INFO L93 Difference]: Finished difference Result 926 states and 1413 transitions. [2019-11-28 00:37:39,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:39,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-28 00:37:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:39,729 INFO L225 Difference]: With dead ends: 926 [2019-11-28 00:37:39,730 INFO L226 Difference]: Without dead ends: 616 [2019-11-28 00:37:39,733 INFO L630 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-28 00:37:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-28 00:37:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-11-28 00:37:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-11-28 00:37:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 930 transitions. [2019-11-28 00:37:39,778 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 930 transitions. Word has length 94 [2019-11-28 00:37:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:39,778 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 930 transitions. [2019-11-28 00:37:39,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 930 transitions. [2019-11-28 00:37:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:37:39,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:39,791 INFO L410 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] [2019-11-28 00:37:39,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1731479778, now seen corresponding path program 1 times [2019-11-28 00:37:39,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:39,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093686448] [2019-11-28 00:37:39,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:39,896 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-28 00:37:39,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093686448] [2019-11-28 00:37:39,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:39,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:39,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222365383] [2019-11-28 00:37:39,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:39,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:39,900 INFO L87 Difference]: Start difference. First operand 614 states and 930 transitions. Second operand 3 states. [2019-11-28 00:37:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:39,967 INFO L93 Difference]: Finished difference Result 1804 states and 2728 transitions. [2019-11-28 00:37:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:39,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 00:37:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:39,981 INFO L225 Difference]: With dead ends: 1804 [2019-11-28 00:37:39,982 INFO L226 Difference]: Without dead ends: 1218 [2019-11-28 00:37:39,985 INFO L630 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-28 00:37:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-28 00:37:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 616. [2019-11-28 00:37:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-11-28 00:37:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 932 transitions. [2019-11-28 00:37:40,034 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 932 transitions. Word has length 95 [2019-11-28 00:37:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:40,036 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 932 transitions. [2019-11-28 00:37:40,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 932 transitions. [2019-11-28 00:37:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-28 00:37:40,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:40,050 INFO L410 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] [2019-11-28 00:37:40,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash 852300571, now seen corresponding path program 1 times [2019-11-28 00:37:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:40,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918012217] [2019-11-28 00:37:40,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:40,185 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-28 00:37:40,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918012217] [2019-11-28 00:37:40,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:40,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:40,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197158633] [2019-11-28 00:37:40,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:40,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:40,189 INFO L87 Difference]: Start difference. First operand 616 states and 932 transitions. Second operand 3 states. [2019-11-28 00:37:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:40,346 INFO L93 Difference]: Finished difference Result 1628 states and 2489 transitions. [2019-11-28 00:37:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:40,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-28 00:37:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:40,354 INFO L225 Difference]: With dead ends: 1628 [2019-11-28 00:37:40,354 INFO L226 Difference]: Without dead ends: 1190 [2019-11-28 00:37:40,356 INFO L630 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-28 00:37:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-28 00:37:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1188. [2019-11-28 00:37:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-11-28 00:37:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1783 transitions. [2019-11-28 00:37:40,436 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1783 transitions. Word has length 96 [2019-11-28 00:37:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:40,438 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1783 transitions. [2019-11-28 00:37:40,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1783 transitions. [2019-11-28 00:37:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-28 00:37:40,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:40,442 INFO L410 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] [2019-11-28 00:37:40,443 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash 809550136, now seen corresponding path program 1 times [2019-11-28 00:37:40,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:40,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055936937] [2019-11-28 00:37:40,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:40,654 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-28 00:37:40,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055936937] [2019-11-28 00:37:40,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:40,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:40,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232821848] [2019-11-28 00:37:40,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:40,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:40,657 INFO L87 Difference]: Start difference. First operand 1188 states and 1783 transitions. Second operand 4 states. [2019-11-28 00:37:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:40,731 INFO L93 Difference]: Finished difference Result 1927 states and 2914 transitions. [2019-11-28 00:37:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:40,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-28 00:37:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:40,736 INFO L225 Difference]: With dead ends: 1927 [2019-11-28 00:37:40,736 INFO L226 Difference]: Without dead ends: 907 [2019-11-28 00:37:40,738 INFO L630 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-28 00:37:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-11-28 00:37:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2019-11-28 00:37:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-28 00:37:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1354 transitions. [2019-11-28 00:37:40,782 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1354 transitions. Word has length 96 [2019-11-28 00:37:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:40,783 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1354 transitions. [2019-11-28 00:37:40,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1354 transitions. [2019-11-28 00:37:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 00:37:40,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:40,785 INFO L410 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] [2019-11-28 00:37:40,785 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1935153407, now seen corresponding path program 1 times [2019-11-28 00:37:40,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:40,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041889293] [2019-11-28 00:37:40,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:40,886 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-28 00:37:40,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041889293] [2019-11-28 00:37:40,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:40,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:40,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116599232] [2019-11-28 00:37:40,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:37:40,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:37:40,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:37:40,889 INFO L87 Difference]: Start difference. First operand 907 states and 1354 transitions. Second operand 5 states. [2019-11-28 00:37:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:41,177 INFO L93 Difference]: Finished difference Result 1649 states and 2494 transitions. [2019-11-28 00:37:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:37:41,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-28 00:37:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:41,182 INFO L225 Difference]: With dead ends: 1649 [2019-11-28 00:37:41,183 INFO L226 Difference]: Without dead ends: 909 [2019-11-28 00:37:41,184 INFO L630 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-28 00:37:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-28 00:37:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-11-28 00:37:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-28 00:37:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1344 transitions. [2019-11-28 00:37:41,245 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1344 transitions. Word has length 98 [2019-11-28 00:37:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:41,246 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1344 transitions. [2019-11-28 00:37:41,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:37:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1344 transitions. [2019-11-28 00:37:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 00:37:41,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:41,250 INFO L410 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] [2019-11-28 00:37:41,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1498627686, now seen corresponding path program 1 times [2019-11-28 00:37:41,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:41,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132249406] [2019-11-28 00:37:41,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:41,415 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-28 00:37:41,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132249406] [2019-11-28 00:37:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:41,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448365470] [2019-11-28 00:37:41,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:41,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:41,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:41,422 INFO L87 Difference]: Start difference. First operand 907 states and 1344 transitions. Second operand 4 states. [2019-11-28 00:37:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:41,572 INFO L93 Difference]: Finished difference Result 2271 states and 3370 transitions. [2019-11-28 00:37:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:41,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-28 00:37:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:41,579 INFO L225 Difference]: With dead ends: 2271 [2019-11-28 00:37:41,579 INFO L226 Difference]: Without dead ends: 1383 [2019-11-28 00:37:41,581 INFO L630 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-28 00:37:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-11-28 00:37:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2019-11-28 00:37:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-11-28 00:37:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2030 transitions. [2019-11-28 00:37:41,675 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2030 transitions. Word has length 98 [2019-11-28 00:37:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:41,676 INFO L462 AbstractCegarLoop]: Abstraction has 1381 states and 2030 transitions. [2019-11-28 00:37:41,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2030 transitions. [2019-11-28 00:37:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 00:37:41,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:41,679 INFO L410 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] [2019-11-28 00:37:41,680 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1326444855, now seen corresponding path program 1 times [2019-11-28 00:37:41,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:41,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479603090] [2019-11-28 00:37:41,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:41,772 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-28 00:37:41,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479603090] [2019-11-28 00:37:41,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:41,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:41,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955868612] [2019-11-28 00:37:41,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:41,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:41,776 INFO L87 Difference]: Start difference. First operand 1381 states and 2030 transitions. Second operand 3 states. [2019-11-28 00:37:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:41,991 INFO L93 Difference]: Finished difference Result 3595 states and 5371 transitions. [2019-11-28 00:37:41,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:41,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 00:37:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:42,004 INFO L225 Difference]: With dead ends: 3595 [2019-11-28 00:37:42,005 INFO L226 Difference]: Without dead ends: 2553 [2019-11-28 00:37:42,008 INFO L630 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-28 00:37:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-28 00:37:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2551. [2019-11-28 00:37:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-11-28 00:37:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3739 transitions. [2019-11-28 00:37:42,289 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3739 transitions. Word has length 100 [2019-11-28 00:37:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:42,289 INFO L462 AbstractCegarLoop]: Abstraction has 2551 states and 3739 transitions. [2019-11-28 00:37:42,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3739 transitions. [2019-11-28 00:37:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 00:37:42,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:42,295 INFO L410 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] [2019-11-28 00:37:42,295 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash 540060070, now seen corresponding path program 1 times [2019-11-28 00:37:42,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:42,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274495400] [2019-11-28 00:37:42,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:42,455 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-28 00:37:42,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274495400] [2019-11-28 00:37:42,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:42,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:42,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836854287] [2019-11-28 00:37:42,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:42,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:42,462 INFO L87 Difference]: Start difference. First operand 2551 states and 3739 transitions. Second operand 4 states. [2019-11-28 00:37:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:42,610 INFO L93 Difference]: Finished difference Result 3919 states and 5775 transitions. [2019-11-28 00:37:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:42,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-28 00:37:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:42,621 INFO L225 Difference]: With dead ends: 3919 [2019-11-28 00:37:42,621 INFO L226 Difference]: Without dead ends: 2087 [2019-11-28 00:37:42,624 INFO L630 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-28 00:37:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-11-28 00:37:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2087. [2019-11-28 00:37:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-28 00:37:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3043 transitions. [2019-11-28 00:37:42,746 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3043 transitions. Word has length 100 [2019-11-28 00:37:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:42,747 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 3043 transitions. [2019-11-28 00:37:42,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3043 transitions. [2019-11-28 00:37:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 00:37:42,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:42,750 INFO L410 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-28 00:37:42,750 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1007064308, now seen corresponding path program 1 times [2019-11-28 00:37:42,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:42,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838375845] [2019-11-28 00:37:42,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:42,940 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-28 00:37:42,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838375845] [2019-11-28 00:37:42,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:42,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:42,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273305838] [2019-11-28 00:37:42,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:42,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:42,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:42,944 INFO L87 Difference]: Start difference. First operand 2087 states and 3043 transitions. Second operand 4 states. [2019-11-28 00:37:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:43,202 INFO L93 Difference]: Finished difference Result 6026 states and 8773 transitions. [2019-11-28 00:37:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:43,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-28 00:37:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:43,221 INFO L225 Difference]: With dead ends: 6026 [2019-11-28 00:37:43,221 INFO L226 Difference]: Without dead ends: 3978 [2019-11-28 00:37:43,226 INFO L630 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-28 00:37:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-11-28 00:37:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3976. [2019-11-28 00:37:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-11-28 00:37:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5737 transitions. [2019-11-28 00:37:43,479 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5737 transitions. Word has length 102 [2019-11-28 00:37:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:43,480 INFO L462 AbstractCegarLoop]: Abstraction has 3976 states and 5737 transitions. [2019-11-28 00:37:43,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5737 transitions. [2019-11-28 00:37:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 00:37:43,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:43,485 INFO L410 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-28 00:37:43,486 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1753273302, now seen corresponding path program 1 times [2019-11-28 00:37:43,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:43,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684476053] [2019-11-28 00:37:43,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:43,532 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-28 00:37:43,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684476053] [2019-11-28 00:37:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:43,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787334423] [2019-11-28 00:37:43,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:43,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:43,536 INFO L87 Difference]: Start difference. First operand 3976 states and 5737 transitions. Second operand 3 states. [2019-11-28 00:37:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:43,951 INFO L93 Difference]: Finished difference Result 11742 states and 16970 transitions. [2019-11-28 00:37:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:43,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-28 00:37:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:43,987 INFO L225 Difference]: With dead ends: 11742 [2019-11-28 00:37:43,988 INFO L226 Difference]: Without dead ends: 7868 [2019-11-28 00:37:43,995 INFO L630 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-28 00:37:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-11-28 00:37:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 3982. [2019-11-28 00:37:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-11-28 00:37:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5743 transitions. [2019-11-28 00:37:44,278 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5743 transitions. Word has length 103 [2019-11-28 00:37:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:44,278 INFO L462 AbstractCegarLoop]: Abstraction has 3982 states and 5743 transitions. [2019-11-28 00:37:44,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5743 transitions. [2019-11-28 00:37:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 00:37:44,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:44,284 INFO L410 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] [2019-11-28 00:37:44,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1236928437, now seen corresponding path program 1 times [2019-11-28 00:37:44,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:44,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544274513] [2019-11-28 00:37:44,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:44,382 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-28 00:37:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544274513] [2019-11-28 00:37:44,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:44,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458813451] [2019-11-28 00:37:44,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:44,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:44,385 INFO L87 Difference]: Start difference. First operand 3982 states and 5743 transitions. Second operand 4 states. [2019-11-28 00:37:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:44,582 INFO L93 Difference]: Finished difference Result 7860 states and 11352 transitions. [2019-11-28 00:37:44,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:44,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-28 00:37:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:44,603 INFO L225 Difference]: With dead ends: 7860 [2019-11-28 00:37:44,604 INFO L226 Difference]: Without dead ends: 3982 [2019-11-28 00:37:44,609 INFO L630 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-28 00:37:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2019-11-28 00:37:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3979. [2019-11-28 00:37:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2019-11-28 00:37:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 5736 transitions. [2019-11-28 00:37:44,865 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 5736 transitions. Word has length 104 [2019-11-28 00:37:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:44,865 INFO L462 AbstractCegarLoop]: Abstraction has 3979 states and 5736 transitions. [2019-11-28 00:37:44,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 5736 transitions. [2019-11-28 00:37:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 00:37:44,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:44,871 INFO L410 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] [2019-11-28 00:37:44,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:44,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash -311646106, now seen corresponding path program 1 times [2019-11-28 00:37:44,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:44,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871255407] [2019-11-28 00:37:44,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:45,013 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-28 00:37:45,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871255407] [2019-11-28 00:37:45,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:45,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:45,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551643152] [2019-11-28 00:37:45,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:45,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:45,016 INFO L87 Difference]: Start difference. First operand 3979 states and 5736 transitions. Second operand 4 states. [2019-11-28 00:37:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:45,196 INFO L93 Difference]: Finished difference Result 7919 states and 11417 transitions. [2019-11-28 00:37:45,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:45,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-28 00:37:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:45,210 INFO L225 Difference]: With dead ends: 7919 [2019-11-28 00:37:45,211 INFO L226 Difference]: Without dead ends: 3973 [2019-11-28 00:37:45,217 INFO L630 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-28 00:37:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-11-28 00:37:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3973. [2019-11-28 00:37:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-11-28 00:37:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5724 transitions. [2019-11-28 00:37:45,424 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5724 transitions. Word has length 104 [2019-11-28 00:37:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:45,424 INFO L462 AbstractCegarLoop]: Abstraction has 3973 states and 5724 transitions. [2019-11-28 00:37:45,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5724 transitions. [2019-11-28 00:37:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 00:37:45,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:45,429 INFO L410 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] [2019-11-28 00:37:45,430 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1273450697, now seen corresponding path program 1 times [2019-11-28 00:37:45,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:45,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309404250] [2019-11-28 00:37:45,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:45,494 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-28 00:37:45,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309404250] [2019-11-28 00:37:45,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:45,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:45,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022969432] [2019-11-28 00:37:45,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:45,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:45,497 INFO L87 Difference]: Start difference. First operand 3973 states and 5724 transitions. Second operand 3 states. [2019-11-28 00:37:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:45,831 INFO L93 Difference]: Finished difference Result 9199 states and 13368 transitions. [2019-11-28 00:37:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 00:37:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:45,845 INFO L225 Difference]: With dead ends: 9199 [2019-11-28 00:37:45,846 INFO L226 Difference]: Without dead ends: 5903 [2019-11-28 00:37:45,852 INFO L630 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-28 00:37:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2019-11-28 00:37:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 5901. [2019-11-28 00:37:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5901 states. [2019-11-28 00:37:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 8360 transitions. [2019-11-28 00:37:46,238 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 8360 transitions. Word has length 104 [2019-11-28 00:37:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:46,238 INFO L462 AbstractCegarLoop]: Abstraction has 5901 states and 8360 transitions. [2019-11-28 00:37:46,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 8360 transitions. [2019-11-28 00:37:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 00:37:46,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:46,245 INFO L410 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-28 00:37:46,245 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1563202857, now seen corresponding path program 1 times [2019-11-28 00:37:46,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:46,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951527215] [2019-11-28 00:37:46,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:46,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-28 00:37:46,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951527215] [2019-11-28 00:37:46,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:46,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:46,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561030791] [2019-11-28 00:37:46,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:46,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:46,379 INFO L87 Difference]: Start difference. First operand 5901 states and 8360 transitions. Second operand 4 states. [2019-11-28 00:37:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:46,653 INFO L93 Difference]: Finished difference Result 9249 states and 13168 transitions. [2019-11-28 00:37:46,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:46,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-28 00:37:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:46,665 INFO L225 Difference]: With dead ends: 9249 [2019-11-28 00:37:46,665 INFO L226 Difference]: Without dead ends: 5340 [2019-11-28 00:37:46,671 INFO L630 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-28 00:37:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2019-11-28 00:37:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5303. [2019-11-28 00:37:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-11-28 00:37:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 7467 transitions. [2019-11-28 00:37:47,032 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 7467 transitions. Word has length 106 [2019-11-28 00:37:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:47,032 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 7467 transitions. [2019-11-28 00:37:47,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 7467 transitions. [2019-11-28 00:37:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-28 00:37:47,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:47,039 INFO L410 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-28 00:37:47,039 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1863296286, now seen corresponding path program 1 times [2019-11-28 00:37:47,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:47,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712239664] [2019-11-28 00:37:47,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:47,167 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-28 00:37:47,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712239664] [2019-11-28 00:37:47,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:47,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:47,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088597314] [2019-11-28 00:37:47,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:47,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:47,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:47,170 INFO L87 Difference]: Start difference. First operand 5303 states and 7467 transitions. Second operand 4 states. [2019-11-28 00:37:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:47,665 INFO L93 Difference]: Finished difference Result 10601 states and 14931 transitions. [2019-11-28 00:37:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:47,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-28 00:37:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:47,676 INFO L225 Difference]: With dead ends: 10601 [2019-11-28 00:37:47,677 INFO L226 Difference]: Without dead ends: 5449 [2019-11-28 00:37:47,682 INFO L630 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-28 00:37:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-11-28 00:37:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5395. [2019-11-28 00:37:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5395 states. [2019-11-28 00:37:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 7560 transitions. [2019-11-28 00:37:47,944 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 7560 transitions. Word has length 108 [2019-11-28 00:37:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:47,944 INFO L462 AbstractCegarLoop]: Abstraction has 5395 states and 7560 transitions. [2019-11-28 00:37:47,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 7560 transitions. [2019-11-28 00:37:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-28 00:37:47,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:47,951 INFO L410 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] [2019-11-28 00:37:47,951 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash -739400144, now seen corresponding path program 1 times [2019-11-28 00:37:47,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:47,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021255720] [2019-11-28 00:37:47,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:47,998 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-28 00:37:47,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021255720] [2019-11-28 00:37:47,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:48,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:48,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762193659] [2019-11-28 00:37:48,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:48,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:48,002 INFO L87 Difference]: Start difference. First operand 5395 states and 7560 transitions. Second operand 3 states. [2019-11-28 00:37:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:48,422 INFO L93 Difference]: Finished difference Result 14244 states and 20130 transitions. [2019-11-28 00:37:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:48,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-28 00:37:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:48,444 INFO L225 Difference]: With dead ends: 14244 [2019-11-28 00:37:48,445 INFO L226 Difference]: Without dead ends: 10589 [2019-11-28 00:37:48,453 INFO L630 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-28 00:37:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2019-11-28 00:37:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 5405. [2019-11-28 00:37:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-28 00:37:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7570 transitions. [2019-11-28 00:37:48,881 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7570 transitions. Word has length 109 [2019-11-28 00:37:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:48,881 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7570 transitions. [2019-11-28 00:37:48,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7570 transitions. [2019-11-28 00:37:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 00:37:48,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:48,887 INFO L410 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-28 00:37:48,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 457490185, now seen corresponding path program 1 times [2019-11-28 00:37:48,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:48,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168756707] [2019-11-28 00:37:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:48,968 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-28 00:37:48,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168756707] [2019-11-28 00:37:48,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:48,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:37:48,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573937349] [2019-11-28 00:37:48,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:37:48,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:37:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:37:48,972 INFO L87 Difference]: Start difference. First operand 5405 states and 7570 transitions. Second operand 3 states. [2019-11-28 00:37:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:49,828 INFO L93 Difference]: Finished difference Result 11159 states and 16678 transitions. [2019-11-28 00:37:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:37:49,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-28 00:37:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:49,849 INFO L225 Difference]: With dead ends: 11159 [2019-11-28 00:37:49,849 INFO L226 Difference]: Without dead ends: 8282 [2019-11-28 00:37:49,856 INFO L630 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-28 00:37:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-11-28 00:37:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8259. [2019-11-28 00:37:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-11-28 00:37:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11955 transitions. [2019-11-28 00:37:50,586 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11955 transitions. Word has length 110 [2019-11-28 00:37:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:50,586 INFO L462 AbstractCegarLoop]: Abstraction has 8259 states and 11955 transitions. [2019-11-28 00:37:50,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:37:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11955 transitions. [2019-11-28 00:37:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 00:37:50,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:50,592 INFO L410 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-28 00:37:50,592 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 279020462, now seen corresponding path program 1 times [2019-11-28 00:37:50,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:50,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453647809] [2019-11-28 00:37:50,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:50,777 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-28 00:37:50,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453647809] [2019-11-28 00:37:50,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:50,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:37:50,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542703309] [2019-11-28 00:37:50,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:37:50,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:37:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:37:50,781 INFO L87 Difference]: Start difference. First operand 8259 states and 11955 transitions. Second operand 8 states. [2019-11-28 00:37:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:51,660 INFO L93 Difference]: Finished difference Result 14429 states and 21458 transitions. [2019-11-28 00:37:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:51,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-11-28 00:37:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:51,675 INFO L225 Difference]: With dead ends: 14429 [2019-11-28 00:37:51,675 INFO L226 Difference]: Without dead ends: 8261 [2019-11-28 00:37:51,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:37:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2019-11-28 00:37:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 8259. [2019-11-28 00:37:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-11-28 00:37:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11892 transitions. [2019-11-28 00:37:52,217 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11892 transitions. Word has length 110 [2019-11-28 00:37:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:52,217 INFO L462 AbstractCegarLoop]: Abstraction has 8259 states and 11892 transitions. [2019-11-28 00:37:52,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:37:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11892 transitions. [2019-11-28 00:37:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 00:37:52,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:52,222 INFO L410 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-28 00:37:52,222 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash -747341858, now seen corresponding path program 1 times [2019-11-28 00:37:52,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:52,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891573778] [2019-11-28 00:37:52,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:52,345 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-28 00:37:52,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891573778] [2019-11-28 00:37:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972279824] [2019-11-28 00:37:52,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:52,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:52,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:52,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:52,348 INFO L87 Difference]: Start difference. First operand 8259 states and 11892 transitions. Second operand 4 states. [2019-11-28 00:37:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:52,976 INFO L93 Difference]: Finished difference Result 16626 states and 23899 transitions. [2019-11-28 00:37:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:52,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-28 00:37:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:52,989 INFO L225 Difference]: With dead ends: 16626 [2019-11-28 00:37:52,989 INFO L226 Difference]: Without dead ends: 8622 [2019-11-28 00:37:53,001 INFO L630 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-28 00:37:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2019-11-28 00:37:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 8485. [2019-11-28 00:37:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8485 states. [2019-11-28 00:37:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8485 states to 8485 states and 12125 transitions. [2019-11-28 00:37:53,672 INFO L78 Accepts]: Start accepts. Automaton has 8485 states and 12125 transitions. Word has length 110 [2019-11-28 00:37:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:53,673 INFO L462 AbstractCegarLoop]: Abstraction has 8485 states and 12125 transitions. [2019-11-28 00:37:53,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8485 states and 12125 transitions. [2019-11-28 00:37:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 00:37:53,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:53,677 INFO L410 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-28 00:37:53,677 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash 277574495, now seen corresponding path program 1 times [2019-11-28 00:37:53,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:53,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87444169] [2019-11-28 00:37:53,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:53,793 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-28 00:37:53,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87444169] [2019-11-28 00:37:53,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:53,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:37:53,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147792645] [2019-11-28 00:37:53,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:37:53,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:37:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:37:53,799 INFO L87 Difference]: Start difference. First operand 8485 states and 12125 transitions. Second operand 4 states. [2019-11-28 00:37:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:37:54,539 INFO L93 Difference]: Finished difference Result 11836 states and 17001 transitions. [2019-11-28 00:37:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:37:54,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-28 00:37:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:37:54,547 INFO L225 Difference]: With dead ends: 11836 [2019-11-28 00:37:54,547 INFO L226 Difference]: Without dead ends: 7346 [2019-11-28 00:37:54,552 INFO L630 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-28 00:37:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2019-11-28 00:37:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7346. [2019-11-28 00:37:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7346 states. [2019-11-28 00:37:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10477 transitions. [2019-11-28 00:37:54,916 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10477 transitions. Word has length 110 [2019-11-28 00:37:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:37:54,916 INFO L462 AbstractCegarLoop]: Abstraction has 7346 states and 10477 transitions. [2019-11-28 00:37:54,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:37:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10477 transitions. [2019-11-28 00:37:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 00:37:54,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:37:54,921 INFO L410 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-28 00:37:54,921 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:37:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:37:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1751147279, now seen corresponding path program 1 times [2019-11-28 00:37:54,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:37:54,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750524711] [2019-11-28 00:37:54,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:37:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:37:56,015 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-28 00:37:56,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750524711] [2019-11-28 00:37:56,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:37:56,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-28 00:37:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344390063] [2019-11-28 00:37:56,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:37:56,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:37:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:37:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:37:56,018 INFO L87 Difference]: Start difference. First operand 7346 states and 10477 transitions. Second operand 22 states. [2019-11-28 00:37:56,707 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-28 00:37:56,898 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-28 00:37:57,331 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-28 00:37:57,575 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-28 00:38:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:38:01,430 INFO L93 Difference]: Finished difference Result 20738 states and 30496 transitions. [2019-11-28 00:38:01,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:38:01,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2019-11-28 00:38:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:38:01,450 INFO L225 Difference]: With dead ends: 20738 [2019-11-28 00:38:01,450 INFO L226 Difference]: Without dead ends: 18362 [2019-11-28 00:38:01,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:38:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2019-11-28 00:38:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 7847. [2019-11-28 00:38:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7847 states. [2019-11-28 00:38:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 11090 transitions. [2019-11-28 00:38:02,144 INFO L78 Accepts]: Start accepts. Automaton has 7847 states and 11090 transitions. Word has length 112 [2019-11-28 00:38:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:38:02,145 INFO L462 AbstractCegarLoop]: Abstraction has 7847 states and 11090 transitions. [2019-11-28 00:38:02,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:38:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7847 states and 11090 transitions. [2019-11-28 00:38:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 00:38:02,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:38:02,149 INFO L410 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-28 00:38:02,150 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:38:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:38:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 26877819, now seen corresponding path program 1 times [2019-11-28 00:38:02,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:38:02,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743062548] [2019-11-28 00:38:02,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:38:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:38:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:38:02,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:38:02,377 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:38:02,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:38:02 BoogieIcfgContainer [2019-11-28 00:38:02,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:38:02,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:38:02,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:38:02,655 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:38:02,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:37:38" (3/4) ... [2019-11-28 00:38:02,659 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:38:02,904 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:38:02,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:38:02,906 INFO L168 Benchmark]: Toolchain (without parser) took 26920.36 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 956.3 MB in the beginning and 785.3 MB in the end (delta: 171.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,907 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:38:02,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:38:02,908 INFO L168 Benchmark]: Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,908 INFO L168 Benchmark]: RCFGBuilder took 1416.76 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: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,909 INFO L168 Benchmark]: TraceAbstraction took 24390.72 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 821.8 MB in the end (delta: 182.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,909 INFO L168 Benchmark]: Witness Printer took 249.99 ms. Allocated memory is still 2.7 GB. Free memory was 821.8 MB in the beginning and 785.3 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:38:02,911 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 701.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1416.76 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: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24390.72 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 821.8 MB in the end (delta: 182.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 249.99 ms. Allocated memory is still 2.7 GB. Free memory was 821.8 MB in the beginning and 785.3 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 527]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1131; [L65] int __return_1259; [L66] int __return_1378; [L67] int __tmp_1379_0; [L68] int __return_1487; [L69] int __return_1392; VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=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, 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] [L72] int main__c1; [L73] int main__i2; [L74] main__c1 = 0 [L75] ep12 = __VERIFIER_nondet_bool() [L76] ep13 = __VERIFIER_nondet_bool() [L77] ep21 = __VERIFIER_nondet_bool() [L78] ep23 = __VERIFIER_nondet_bool() [L79] ep31 = __VERIFIER_nondet_bool() [L80] ep32 = __VERIFIER_nondet_bool() [L81] id1 = __VERIFIER_nondet_char() [L82] r1 = __VERIFIER_nondet_char() [L83] st1 = __VERIFIER_nondet_char() [L84] nl1 = __VERIFIER_nondet_char() [L85] m1 = __VERIFIER_nondet_char() [L86] max1 = __VERIFIER_nondet_char() [L87] mode1 = __VERIFIER_nondet_bool() [L88] id2 = __VERIFIER_nondet_char() [L89] r2 = __VERIFIER_nondet_char() [L90] st2 = __VERIFIER_nondet_char() [L91] nl2 = __VERIFIER_nondet_char() [L92] m2 = __VERIFIER_nondet_char() [L93] max2 = __VERIFIER_nondet_char() [L94] mode2 = __VERIFIER_nondet_bool() [L95] id3 = __VERIFIER_nondet_char() [L96] r3 = __VERIFIER_nondet_char() [L97] st3 = __VERIFIER_nondet_char() [L98] nl3 = __VERIFIER_nondet_char() [L99] m3 = __VERIFIER_nondet_char() [L100] max3 = __VERIFIER_nondet_char() [L101] mode3 = __VERIFIER_nondet_bool() [L103] _Bool init__r121; [L104] _Bool init__r131; [L105] _Bool init__r211; [L106] _Bool init__r231; [L107] _Bool init__r311; [L108] _Bool init__r321; [L109] _Bool init__r122; [L110] int init__tmp; [L111] _Bool init__r132; [L112] int init__tmp___0; [L113] _Bool init__r212; [L114] int init__tmp___1; [L115] _Bool init__r232; [L116] int init__tmp___2; [L117] _Bool init__r312; [L118] int init__tmp___3; [L119] _Bool init__r322; [L120] int init__tmp___4; [L121] int init__tmp___5; [L122] init__r121 = ep12 [L123] init__r131 = ep13 [L124] init__r211 = ep21 [L125] init__r231 = ep23 [L126] init__r311 = ep31 [L127] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L128] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1617] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1619] COND TRUE !(ep32 == 0) [L1621] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L132] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L133] COND TRUE !(init__r131 == 0) [L135] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L137] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L138] COND TRUE !(init__r211 == 0) [L140] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L142] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L143] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1548] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1550] COND TRUE !(ep13 == 0) [L1552] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L147] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L148] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1525] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L1527] COND TRUE !(ep21 == 0) [L1529] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L152] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L153] COND TRUE !(init__r321 == 0) [L155] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L157] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L158] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L160] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L162] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L164] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L166] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L168] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L170] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L172] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L174] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L176] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L178] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L180] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L182] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L184] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L186] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L188] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L190] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L192] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L194] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L196] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L198] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L200] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L202] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L204] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L206] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L208] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L210] COND TRUE ((int)mode3) == 0 [L212] init__tmp___5 = 1 [L213] __return_1131 = init__tmp___5 [L214] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=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] [L215] COND TRUE main__i2 != 0 [L217] p12_old = nomsg [L218] p12_new = nomsg [L219] p13_old = nomsg [L220] p13_new = nomsg [L221] p21_old = nomsg [L222] p21_new = nomsg [L223] p23_old = nomsg [L224] p23_new = nomsg [L225] p31_old = nomsg [L226] p31_new = nomsg [L227] p32_old = nomsg [L228] p32_new = nomsg [L229] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE !(ep13 == 0) [L254] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE p13_new == nomsg [L259] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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 !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L271] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L273] COND TRUE !(ep21 == 0) [L275] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L276] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] COND TRUE p21_new == nomsg [L280] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L284] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L295] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L297] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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 ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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 FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L316] COND TRUE !(ep32 == 0) [L318] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L319] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L321] COND TRUE p32_new == nomsg [L323] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L325] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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=0, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L327] mode3 = 1 [L328] p12_old = p12_new [L329] p12_new = nomsg [L330] p13_old = p13_new [L331] p13_new = nomsg [L332] p21_old = p21_new [L333] p21_new = nomsg [L334] p23_old = p23_new [L335] p23_new = nomsg [L336] p31_old = p31_new [L337] p31_new = nomsg [L338] p32_old = p32_new [L339] p32_new = nomsg [L341] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((int)r1) < 2 [L370] check__tmp = 1 [L371] __return_1259 = check__tmp [L372] main__c1 = __return_1259 [L374] _Bool __tmp_1; [L375] __tmp_1 = main__c1 [L376] _Bool assert__arg; [L377] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(assert__arg == 0) [L384] int main____CPAchecker_TMP_0 = main__i2; [L385] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE !(mode1 == 0) [L391] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=0, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE !(ep21 == 0) [L394] m1 = p21_old [L395] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((int)max1) == ((int)id1) [L412] st1 = 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L414] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L416] COND TRUE !(mode2 == 0) [L418] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L419] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L427] COND TRUE !(ep32 == 0) [L429] m2 = p32_old [L430] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=1, st2=0, st3=0] [L431] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=1, st2=0, st3=0] [L435] COND FALSE !(((int)r2) == 2) [L441] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=1, st2=0, st3=0] [L443] COND TRUE !(mode3 == 0) [L445] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=0, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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] [L446] COND TRUE !(ep13 == 0) [L448] m3 = p13_old [L449] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L450] COND TRUE ((int)m3) > ((int)max3) [L452] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L454] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L462] COND FALSE !(((int)r3) == 2) [L468] mode3 = 0 [L469] p12_old = p12_new [L470] p12_new = nomsg [L471] p13_old = p13_new [L472] p13_new = nomsg [L473] p21_old = p21_new [L474] p21_new = nomsg [L475] p23_old = p23_new [L476] p23_new = nomsg [L477] p31_old = p31_new [L478] p31_new = nomsg [L479] p32_old = p32_new [L480] p32_new = nomsg [L482] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L483] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L485] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L487] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L489] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L491] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1065] check__tmp = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L515] __return_1378 = check__tmp [L516] main__c1 = __return_1378 [L517] __tmp_1379_0 = main____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L519] main____CPAchecker_TMP_0 = __tmp_1379_0 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] __VERIFIER_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=1, id3=0, m1=1, m2=0, m3=3, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 218 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9737 SDtfs, 11360 SDslu, 14204 SDs, 0 SdLazy, 3192 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8485occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 20459 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2375 NumberOfCodeBlocks, 2375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...