./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-6b5699a [2019-11-25 08:57:27,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:27,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:27,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:27,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:27,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:27,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:27,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:27,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:27,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:27,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:27,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:27,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:27,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:27,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:27,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:27,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:27,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:27,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:27,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:27,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:27,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:27,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:27,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:27,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:27,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:27,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:27,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:27,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:27,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:27,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:27,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:27,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:27,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:27,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:27,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:27,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:27,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:27,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:27,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:27,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:27,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:27,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:27,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:27,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:27,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:27,823 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:27,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:27,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:27,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:27,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:27,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:27,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:27,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:27,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:27,825 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:27,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:27,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:27,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:27,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:27,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:27,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:27,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:27,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:27,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:27,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:27,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:27,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:27,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:27,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:27,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f647c6008697302f06b1d1dda080bf4ccd77afb [2019-11-25 08:57:28,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:28,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:28,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:28,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:28,030 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:28,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-25 08:57:28,086 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/data/552f25d4e/dbc9ff16e6bd4026837f44f0d4064126/FLAGfbfcc0e37 [2019-11-25 08:57:28,550 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:28,551 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-25 08:57:28,563 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/data/552f25d4e/dbc9ff16e6bd4026837f44f0d4064126/FLAGfbfcc0e37 [2019-11-25 08:57:28,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/data/552f25d4e/dbc9ff16e6bd4026837f44f0d4064126 [2019-11-25 08:57:28,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:28,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:28,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:28,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:28,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:28,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:28" (1/1) ... [2019-11-25 08:57:28,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efeab06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:28, skipping insertion in model container [2019-11-25 08:57:28,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:28" (1/1) ... [2019-11-25 08:57:28,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:28,979 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:29,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:29,359 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:29,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:29,531 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:29,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29 WrapperNode [2019-11-25 08:57:29,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:29,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:29,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:29,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:29,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:29,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:29,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:29,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:29,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:29,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:29,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:29,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:29,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:30,853 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:30,854 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:57:30,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30 BoogieIcfgContainer [2019-11-25 08:57:30,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:30,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:30,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:30,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:30,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:28" (1/3) ... [2019-11-25 08:57:30,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fab16e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:30, skipping insertion in model container [2019-11-25 08:57:30,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (2/3) ... [2019-11-25 08:57:30,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fab16e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:30, skipping insertion in model container [2019-11-25 08:57:30,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30" (3/3) ... [2019-11-25 08:57:30,862 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-25 08:57:30,874 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:30,882 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:30,892 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:30,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:30,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:30,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:30,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:30,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:30,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:30,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:30,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2019-11-25 08:57:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 08:57:30,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:30,964 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-25 08:57:30,964 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1207420229, now seen corresponding path program 1 times [2019-11-25 08:57:30,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:30,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175495347] [2019-11-25 08:57:30,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175495347] [2019-11-25 08:57:31,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:31,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598167421] [2019-11-25 08:57:31,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:31,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,355 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 3 states. [2019-11-25 08:57:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:31,521 INFO L93 Difference]: Finished difference Result 432 states and 754 transitions. [2019-11-25 08:57:31,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:31,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-25 08:57:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:31,538 INFO L225 Difference]: With dead ends: 432 [2019-11-25 08:57:31,538 INFO L226 Difference]: Without dead ends: 321 [2019-11-25 08:57:31,541 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-25 08:57:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-25 08:57:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2019-11-25 08:57:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-25 08:57:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 488 transitions. [2019-11-25 08:57:31,612 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 488 transitions. Word has length 94 [2019-11-25 08:57:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:31,613 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 488 transitions. [2019-11-25 08:57:31,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 488 transitions. [2019-11-25 08:57:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 08:57:31,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:31,620 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-25 08:57:31,621 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1721200426, now seen corresponding path program 1 times [2019-11-25 08:57:31,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:31,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455276839] [2019-11-25 08:57:31,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,983 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-25 08:57:31,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455276839] [2019-11-25 08:57:31,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:31,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483202355] [2019-11-25 08:57:31,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:31,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:31,987 INFO L87 Difference]: Start difference. First operand 319 states and 488 transitions. Second operand 4 states. [2019-11-25 08:57:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,127 INFO L93 Difference]: Finished difference Result 926 states and 1413 transitions. [2019-11-25 08:57:32,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:32,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-25 08:57:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,133 INFO L225 Difference]: With dead ends: 926 [2019-11-25 08:57:32,133 INFO L226 Difference]: Without dead ends: 616 [2019-11-25 08:57:32,141 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-25 08:57:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-25 08:57:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-11-25 08:57:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-11-25 08:57:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 930 transitions. [2019-11-25 08:57:32,223 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 930 transitions. Word has length 94 [2019-11-25 08:57:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,225 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 930 transitions. [2019-11-25 08:57:32,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 930 transitions. [2019-11-25 08:57:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-25 08:57:32,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,236 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-25 08:57:32,236 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1731479778, now seen corresponding path program 1 times [2019-11-25 08:57:32,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342217203] [2019-11-25 08:57:32,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,310 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-25 08:57:32,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342217203] [2019-11-25 08:57:32,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:32,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029496905] [2019-11-25 08:57:32,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:32,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,313 INFO L87 Difference]: Start difference. First operand 614 states and 930 transitions. Second operand 3 states. [2019-11-25 08:57:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,369 INFO L93 Difference]: Finished difference Result 1804 states and 2728 transitions. [2019-11-25 08:57:32,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:32,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-25 08:57:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,377 INFO L225 Difference]: With dead ends: 1804 [2019-11-25 08:57:32,377 INFO L226 Difference]: Without dead ends: 1218 [2019-11-25 08:57:32,378 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-25 08:57:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-25 08:57:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 616. [2019-11-25 08:57:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-11-25 08:57:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 932 transitions. [2019-11-25 08:57:32,416 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 932 transitions. Word has length 95 [2019-11-25 08:57:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,416 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 932 transitions. [2019-11-25 08:57:32,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 932 transitions. [2019-11-25 08:57:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:57:32,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,418 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-25 08:57:32,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 852300571, now seen corresponding path program 1 times [2019-11-25 08:57:32,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238956017] [2019-11-25 08:57:32,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,507 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-25 08:57:32,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238956017] [2019-11-25 08:57:32,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:32,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315816662] [2019-11-25 08:57:32,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:32,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,510 INFO L87 Difference]: Start difference. First operand 616 states and 932 transitions. Second operand 3 states. [2019-11-25 08:57:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,638 INFO L93 Difference]: Finished difference Result 1628 states and 2489 transitions. [2019-11-25 08:57:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:32,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-25 08:57:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,646 INFO L225 Difference]: With dead ends: 1628 [2019-11-25 08:57:32,646 INFO L226 Difference]: Without dead ends: 1190 [2019-11-25 08:57:32,647 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-25 08:57:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-25 08:57:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1188. [2019-11-25 08:57:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-11-25 08:57:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1783 transitions. [2019-11-25 08:57:32,702 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1783 transitions. Word has length 96 [2019-11-25 08:57:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,703 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1783 transitions. [2019-11-25 08:57:32,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1783 transitions. [2019-11-25 08:57:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:57:32,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,705 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-25 08:57:32,705 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash 809550136, now seen corresponding path program 1 times [2019-11-25 08:57:32,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257504319] [2019-11-25 08:57:32,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,854 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-25 08:57:32,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257504319] [2019-11-25 08:57:32,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:32,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725181665] [2019-11-25 08:57:32,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:32,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:32,857 INFO L87 Difference]: Start difference. First operand 1188 states and 1783 transitions. Second operand 4 states. [2019-11-25 08:57:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,931 INFO L93 Difference]: Finished difference Result 1927 states and 2914 transitions. [2019-11-25 08:57:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:32,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-25 08:57:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,938 INFO L225 Difference]: With dead ends: 1927 [2019-11-25 08:57:32,938 INFO L226 Difference]: Without dead ends: 907 [2019-11-25 08:57:32,939 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-25 08:57:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-11-25 08:57:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2019-11-25 08:57:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-25 08:57:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1354 transitions. [2019-11-25 08:57:32,984 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1354 transitions. Word has length 96 [2019-11-25 08:57:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,985 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1354 transitions. [2019-11-25 08:57:32,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1354 transitions. [2019-11-25 08:57:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:57:32,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,987 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-25 08:57:32,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1935153407, now seen corresponding path program 1 times [2019-11-25 08:57:32,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957801453] [2019-11-25 08:57:32,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,108 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-25 08:57:33,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957801453] [2019-11-25 08:57:33,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:33,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992440789] [2019-11-25 08:57:33,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:33,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:33,111 INFO L87 Difference]: Start difference. First operand 907 states and 1354 transitions. Second operand 5 states. [2019-11-25 08:57:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,417 INFO L93 Difference]: Finished difference Result 1649 states and 2494 transitions. [2019-11-25 08:57:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:33,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-25 08:57:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,424 INFO L225 Difference]: With dead ends: 1649 [2019-11-25 08:57:33,424 INFO L226 Difference]: Without dead ends: 909 [2019-11-25 08:57:33,425 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-25 08:57:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-25 08:57:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-11-25 08:57:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-25 08:57:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1344 transitions. [2019-11-25 08:57:33,484 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1344 transitions. Word has length 98 [2019-11-25 08:57:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1344 transitions. [2019-11-25 08:57:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1344 transitions. [2019-11-25 08:57:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:57:33,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,488 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-25 08:57:33,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1498627686, now seen corresponding path program 1 times [2019-11-25 08:57:33,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381731185] [2019-11-25 08:57:33,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,669 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-25 08:57:33,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381731185] [2019-11-25 08:57:33,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:33,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134329206] [2019-11-25 08:57:33,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:33,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:33,680 INFO L87 Difference]: Start difference. First operand 907 states and 1344 transitions. Second operand 4 states. [2019-11-25 08:57:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,831 INFO L93 Difference]: Finished difference Result 2271 states and 3370 transitions. [2019-11-25 08:57:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:33,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:57:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,839 INFO L225 Difference]: With dead ends: 2271 [2019-11-25 08:57:33,840 INFO L226 Difference]: Without dead ends: 1383 [2019-11-25 08:57:33,842 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-25 08:57:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-11-25 08:57:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2019-11-25 08:57:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-11-25 08:57:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2030 transitions. [2019-11-25 08:57:33,930 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2030 transitions. Word has length 98 [2019-11-25 08:57:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,932 INFO L462 AbstractCegarLoop]: Abstraction has 1381 states and 2030 transitions. [2019-11-25 08:57:33,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2030 transitions. [2019-11-25 08:57:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:57:33,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,936 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-25 08:57:33,936 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1326444855, now seen corresponding path program 1 times [2019-11-25 08:57:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956528973] [2019-11-25 08:57:33,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,022 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-25 08:57:34,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956528973] [2019-11-25 08:57:34,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:34,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831465561] [2019-11-25 08:57:34,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:34,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,025 INFO L87 Difference]: Start difference. First operand 1381 states and 2030 transitions. Second operand 3 states. [2019-11-25 08:57:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,255 INFO L93 Difference]: Finished difference Result 3595 states and 5371 transitions. [2019-11-25 08:57:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:57:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,270 INFO L225 Difference]: With dead ends: 3595 [2019-11-25 08:57:34,270 INFO L226 Difference]: Without dead ends: 2553 [2019-11-25 08:57:34,274 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-25 08:57:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-25 08:57:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2551. [2019-11-25 08:57:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-11-25 08:57:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3739 transitions. [2019-11-25 08:57:34,443 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3739 transitions. Word has length 100 [2019-11-25 08:57:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,443 INFO L462 AbstractCegarLoop]: Abstraction has 2551 states and 3739 transitions. [2019-11-25 08:57:34,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3739 transitions. [2019-11-25 08:57:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:57:34,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,447 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-25 08:57:34,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 540060070, now seen corresponding path program 1 times [2019-11-25 08:57:34,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458212913] [2019-11-25 08:57:34,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,576 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-25 08:57:34,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458212913] [2019-11-25 08:57:34,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:34,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418445216] [2019-11-25 08:57:34,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:34,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:34,583 INFO L87 Difference]: Start difference. First operand 2551 states and 3739 transitions. Second operand 4 states. [2019-11-25 08:57:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,733 INFO L93 Difference]: Finished difference Result 3919 states and 5775 transitions. [2019-11-25 08:57:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:34,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:57:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,744 INFO L225 Difference]: With dead ends: 3919 [2019-11-25 08:57:34,745 INFO L226 Difference]: Without dead ends: 2087 [2019-11-25 08:57:34,747 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-25 08:57:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-11-25 08:57:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2087. [2019-11-25 08:57:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-25 08:57:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3043 transitions. [2019-11-25 08:57:34,873 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3043 transitions. Word has length 100 [2019-11-25 08:57:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,873 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 3043 transitions. [2019-11-25 08:57:34,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3043 transitions. [2019-11-25 08:57:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:57:34,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,876 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-25 08:57:34,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1007064308, now seen corresponding path program 1 times [2019-11-25 08:57:34,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331689874] [2019-11-25 08:57:34,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,011 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-25 08:57:35,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331689874] [2019-11-25 08:57:35,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:35,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614496034] [2019-11-25 08:57:35,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:35,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:35,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:35,013 INFO L87 Difference]: Start difference. First operand 2087 states and 3043 transitions. Second operand 4 states. [2019-11-25 08:57:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:35,326 INFO L93 Difference]: Finished difference Result 6026 states and 8773 transitions. [2019-11-25 08:57:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:35,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:57:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:35,351 INFO L225 Difference]: With dead ends: 6026 [2019-11-25 08:57:35,351 INFO L226 Difference]: Without dead ends: 3978 [2019-11-25 08:57:35,355 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-25 08:57:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-11-25 08:57:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3976. [2019-11-25 08:57:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-11-25 08:57:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5737 transitions. [2019-11-25 08:57:35,661 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5737 transitions. Word has length 102 [2019-11-25 08:57:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:35,662 INFO L462 AbstractCegarLoop]: Abstraction has 3976 states and 5737 transitions. [2019-11-25 08:57:35,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5737 transitions. [2019-11-25 08:57:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-25 08:57:35,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:35,667 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-25 08:57:35,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1753273302, now seen corresponding path program 1 times [2019-11-25 08:57:35,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:35,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859870718] [2019-11-25 08:57:35,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,742 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-25 08:57:35,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859870718] [2019-11-25 08:57:35,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:35,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343275559] [2019-11-25 08:57:35,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,745 INFO L87 Difference]: Start difference. First operand 3976 states and 5737 transitions. Second operand 3 states. [2019-11-25 08:57:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,152 INFO L93 Difference]: Finished difference Result 11742 states and 16970 transitions. [2019-11-25 08:57:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:36,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-25 08:57:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:36,196 INFO L225 Difference]: With dead ends: 11742 [2019-11-25 08:57:36,196 INFO L226 Difference]: Without dead ends: 7868 [2019-11-25 08:57:36,204 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-25 08:57:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-11-25 08:57:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 3982. [2019-11-25 08:57:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-11-25 08:57:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5743 transitions. [2019-11-25 08:57:36,534 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5743 transitions. Word has length 103 [2019-11-25 08:57:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:36,535 INFO L462 AbstractCegarLoop]: Abstraction has 3982 states and 5743 transitions. [2019-11-25 08:57:36,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5743 transitions. [2019-11-25 08:57:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:57:36,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:36,541 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-25 08:57:36,542 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1236928437, now seen corresponding path program 1 times [2019-11-25 08:57:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147630149] [2019-11-25 08:57:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:36,657 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-25 08:57:36,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147630149] [2019-11-25 08:57:36,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:36,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:36,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617243143] [2019-11-25 08:57:36,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:36,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:36,660 INFO L87 Difference]: Start difference. First operand 3982 states and 5743 transitions. Second operand 4 states. [2019-11-25 08:57:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,979 INFO L93 Difference]: Finished difference Result 7860 states and 11352 transitions. [2019-11-25 08:57:36,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:36,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-25 08:57:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:37,006 INFO L225 Difference]: With dead ends: 7860 [2019-11-25 08:57:37,012 INFO L226 Difference]: Without dead ends: 3982 [2019-11-25 08:57:37,016 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-25 08:57:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2019-11-25 08:57:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3979. [2019-11-25 08:57:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2019-11-25 08:57:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 5736 transitions. [2019-11-25 08:57:37,261 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 5736 transitions. Word has length 104 [2019-11-25 08:57:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:37,261 INFO L462 AbstractCegarLoop]: Abstraction has 3979 states and 5736 transitions. [2019-11-25 08:57:37,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 5736 transitions. [2019-11-25 08:57:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:57:37,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:37,266 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-25 08:57:37,266 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -311646106, now seen corresponding path program 1 times [2019-11-25 08:57:37,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:37,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67575058] [2019-11-25 08:57:37,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:37,372 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-25 08:57:37,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67575058] [2019-11-25 08:57:37,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:37,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:37,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252766715] [2019-11-25 08:57:37,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:37,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:37,375 INFO L87 Difference]: Start difference. First operand 3979 states and 5736 transitions. Second operand 4 states. [2019-11-25 08:57:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:37,632 INFO L93 Difference]: Finished difference Result 7919 states and 11417 transitions. [2019-11-25 08:57:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:37,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-25 08:57:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:37,644 INFO L225 Difference]: With dead ends: 7919 [2019-11-25 08:57:37,645 INFO L226 Difference]: Without dead ends: 3973 [2019-11-25 08:57:37,650 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-25 08:57:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-11-25 08:57:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3973. [2019-11-25 08:57:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-11-25 08:57:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5724 transitions. [2019-11-25 08:57:37,897 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5724 transitions. Word has length 104 [2019-11-25 08:57:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:37,897 INFO L462 AbstractCegarLoop]: Abstraction has 3973 states and 5724 transitions. [2019-11-25 08:57:37,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5724 transitions. [2019-11-25 08:57:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:57:37,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:37,902 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-25 08:57:37,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:37,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1273450697, now seen corresponding path program 1 times [2019-11-25 08:57:37,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:37,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496224638] [2019-11-25 08:57:37,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:37,978 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-25 08:57:37,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496224638] [2019-11-25 08:57:37,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076075016] [2019-11-25 08:57:37,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:37,980 INFO L87 Difference]: Start difference. First operand 3973 states and 5724 transitions. Second operand 3 states. [2019-11-25 08:57:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:38,361 INFO L93 Difference]: Finished difference Result 9199 states and 13368 transitions. [2019-11-25 08:57:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:38,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:57:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:38,374 INFO L225 Difference]: With dead ends: 9199 [2019-11-25 08:57:38,374 INFO L226 Difference]: Without dead ends: 5903 [2019-11-25 08:57:38,380 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-25 08:57:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2019-11-25 08:57:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 5901. [2019-11-25 08:57:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5901 states. [2019-11-25 08:57:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 8360 transitions. [2019-11-25 08:57:38,784 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 8360 transitions. Word has length 104 [2019-11-25 08:57:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:38,784 INFO L462 AbstractCegarLoop]: Abstraction has 5901 states and 8360 transitions. [2019-11-25 08:57:38,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 8360 transitions. [2019-11-25 08:57:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:57:38,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:38,790 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-25 08:57:38,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:38,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1563202857, now seen corresponding path program 1 times [2019-11-25 08:57:38,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:38,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235193810] [2019-11-25 08:57:38,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:38,927 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-25 08:57:38,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235193810] [2019-11-25 08:57:38,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:38,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:38,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656602971] [2019-11-25 08:57:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:38,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:38,929 INFO L87 Difference]: Start difference. First operand 5901 states and 8360 transitions. Second operand 4 states. [2019-11-25 08:57:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:39,270 INFO L93 Difference]: Finished difference Result 9249 states and 13168 transitions. [2019-11-25 08:57:39,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:39,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:57:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:39,279 INFO L225 Difference]: With dead ends: 9249 [2019-11-25 08:57:39,280 INFO L226 Difference]: Without dead ends: 5340 [2019-11-25 08:57:39,286 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-25 08:57:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2019-11-25 08:57:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5303. [2019-11-25 08:57:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-11-25 08:57:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 7467 transitions. [2019-11-25 08:57:39,605 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 7467 transitions. Word has length 106 [2019-11-25 08:57:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:39,606 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 7467 transitions. [2019-11-25 08:57:39,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 7467 transitions. [2019-11-25 08:57:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-25 08:57:39,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:39,613 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-25 08:57:39,614 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1863296286, now seen corresponding path program 1 times [2019-11-25 08:57:39,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:39,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127526642] [2019-11-25 08:57:39,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:39,735 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-25 08:57:39,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127526642] [2019-11-25 08:57:39,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:39,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:39,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110871549] [2019-11-25 08:57:39,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:39,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:39,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:39,739 INFO L87 Difference]: Start difference. First operand 5303 states and 7467 transitions. Second operand 4 states. [2019-11-25 08:57:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:40,135 INFO L93 Difference]: Finished difference Result 10601 states and 14931 transitions. [2019-11-25 08:57:40,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:40,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-25 08:57:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:40,145 INFO L225 Difference]: With dead ends: 10601 [2019-11-25 08:57:40,146 INFO L226 Difference]: Without dead ends: 5449 [2019-11-25 08:57:40,151 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-25 08:57:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-11-25 08:57:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5395. [2019-11-25 08:57:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5395 states. [2019-11-25 08:57:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 7560 transitions. [2019-11-25 08:57:40,464 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 7560 transitions. Word has length 108 [2019-11-25 08:57:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:40,465 INFO L462 AbstractCegarLoop]: Abstraction has 5395 states and 7560 transitions. [2019-11-25 08:57:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 7560 transitions. [2019-11-25 08:57:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-25 08:57:40,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:40,471 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-25 08:57:40,471 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash -739400144, now seen corresponding path program 1 times [2019-11-25 08:57:40,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:40,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935576266] [2019-11-25 08:57:40,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:40,513 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-25 08:57:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935576266] [2019-11-25 08:57:40,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:40,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429662686] [2019-11-25 08:57:40,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:40,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:40,517 INFO L87 Difference]: Start difference. First operand 5395 states and 7560 transitions. Second operand 3 states. [2019-11-25 08:57:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:41,048 INFO L93 Difference]: Finished difference Result 14244 states and 20130 transitions. [2019-11-25 08:57:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:41,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-25 08:57:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:41,068 INFO L225 Difference]: With dead ends: 14244 [2019-11-25 08:57:41,068 INFO L226 Difference]: Without dead ends: 10589 [2019-11-25 08:57:41,075 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-25 08:57:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2019-11-25 08:57:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 5405. [2019-11-25 08:57:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-11-25 08:57:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7570 transitions. [2019-11-25 08:57:41,601 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7570 transitions. Word has length 109 [2019-11-25 08:57:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:41,601 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7570 transitions. [2019-11-25 08:57:41,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7570 transitions. [2019-11-25 08:57:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 08:57:41,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:41,607 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-25 08:57:41,607 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 457490185, now seen corresponding path program 1 times [2019-11-25 08:57:41,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:41,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136439278] [2019-11-25 08:57:41,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:41,662 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-25 08:57:41,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136439278] [2019-11-25 08:57:41,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:41,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:41,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643805408] [2019-11-25 08:57:41,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:41,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:41,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:41,664 INFO L87 Difference]: Start difference. First operand 5405 states and 7570 transitions. Second operand 3 states. [2019-11-25 08:57:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:42,269 INFO L93 Difference]: Finished difference Result 11159 states and 16678 transitions. [2019-11-25 08:57:42,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:42,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-25 08:57:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:42,283 INFO L225 Difference]: With dead ends: 11159 [2019-11-25 08:57:42,284 INFO L226 Difference]: Without dead ends: 8282 [2019-11-25 08:57:42,289 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-25 08:57:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-11-25 08:57:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8259. [2019-11-25 08:57:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-11-25 08:57:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11955 transitions. [2019-11-25 08:57:42,868 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11955 transitions. Word has length 110 [2019-11-25 08:57:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:42,868 INFO L462 AbstractCegarLoop]: Abstraction has 8259 states and 11955 transitions. [2019-11-25 08:57:42,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11955 transitions. [2019-11-25 08:57:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 08:57:42,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:42,874 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-25 08:57:42,875 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash 279020462, now seen corresponding path program 1 times [2019-11-25 08:57:42,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:42,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170141898] [2019-11-25 08:57:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:43,189 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-25 08:57:43,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170141898] [2019-11-25 08:57:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:57:43,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964881948] [2019-11-25 08:57:43,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:57:43,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:43,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:57:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:57:43,193 INFO L87 Difference]: Start difference. First operand 8259 states and 11955 transitions. Second operand 8 states. [2019-11-25 08:57:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:43,894 INFO L93 Difference]: Finished difference Result 14429 states and 21458 transitions. [2019-11-25 08:57:43,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:43,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-11-25 08:57:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:43,907 INFO L225 Difference]: With dead ends: 14429 [2019-11-25 08:57:43,907 INFO L226 Difference]: Without dead ends: 8261 [2019-11-25 08:57:43,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2019-11-25 08:57:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 8259. [2019-11-25 08:57:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-11-25 08:57:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11892 transitions. [2019-11-25 08:57:44,528 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11892 transitions. Word has length 110 [2019-11-25 08:57:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:44,529 INFO L462 AbstractCegarLoop]: Abstraction has 8259 states and 11892 transitions. [2019-11-25 08:57:44,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:57:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11892 transitions. [2019-11-25 08:57:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 08:57:44,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:44,535 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-25 08:57:44,535 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash -747341858, now seen corresponding path program 1 times [2019-11-25 08:57:44,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:44,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950708893] [2019-11-25 08:57:44,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:44,674 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-25 08:57:44,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950708893] [2019-11-25 08:57:44,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:44,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:44,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159038093] [2019-11-25 08:57:44,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:44,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:44,676 INFO L87 Difference]: Start difference. First operand 8259 states and 11892 transitions. Second operand 4 states. [2019-11-25 08:57:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:45,583 INFO L93 Difference]: Finished difference Result 16626 states and 23899 transitions. [2019-11-25 08:57:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:45,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-25 08:57:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:45,592 INFO L225 Difference]: With dead ends: 16626 [2019-11-25 08:57:45,592 INFO L226 Difference]: Without dead ends: 8622 [2019-11-25 08:57:45,599 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-25 08:57:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2019-11-25 08:57:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 8485. [2019-11-25 08:57:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8485 states. [2019-11-25 08:57:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8485 states to 8485 states and 12125 transitions. [2019-11-25 08:57:46,076 INFO L78 Accepts]: Start accepts. Automaton has 8485 states and 12125 transitions. Word has length 110 [2019-11-25 08:57:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:46,076 INFO L462 AbstractCegarLoop]: Abstraction has 8485 states and 12125 transitions. [2019-11-25 08:57:46,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8485 states and 12125 transitions. [2019-11-25 08:57:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 08:57:46,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:46,083 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-25 08:57:46,083 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 277574495, now seen corresponding path program 1 times [2019-11-25 08:57:46,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:46,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463925036] [2019-11-25 08:57:46,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:46,178 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-25 08:57:46,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463925036] [2019-11-25 08:57:46,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:46,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:46,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033012673] [2019-11-25 08:57:46,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:46,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:46,181 INFO L87 Difference]: Start difference. First operand 8485 states and 12125 transitions. Second operand 4 states. [2019-11-25 08:57:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:46,691 INFO L93 Difference]: Finished difference Result 11836 states and 17001 transitions. [2019-11-25 08:57:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:46,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-25 08:57:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:46,699 INFO L225 Difference]: With dead ends: 11836 [2019-11-25 08:57:46,699 INFO L226 Difference]: Without dead ends: 7346 [2019-11-25 08:57:46,704 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-25 08:57:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2019-11-25 08:57:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7346. [2019-11-25 08:57:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7346 states. [2019-11-25 08:57:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10477 transitions. [2019-11-25 08:57:47,210 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10477 transitions. Word has length 110 [2019-11-25 08:57:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:47,211 INFO L462 AbstractCegarLoop]: Abstraction has 7346 states and 10477 transitions. [2019-11-25 08:57:47,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10477 transitions. [2019-11-25 08:57:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:57:47,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:47,216 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-25 08:57:47,216 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1751147279, now seen corresponding path program 1 times [2019-11-25 08:57:47,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:47,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095652714] [2019-11-25 08:57:47,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:48,501 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-25 08:57:48,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095652714] [2019-11-25 08:57:48,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:48,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-25 08:57:48,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219672959] [2019-11-25 08:57:48,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 08:57:48,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:57:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:57:48,503 INFO L87 Difference]: Start difference. First operand 7346 states and 10477 transitions. Second operand 22 states. [2019-11-25 08:57:49,228 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-25 08:57:49,440 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-25 08:57:49,805 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-25 08:57:49,997 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-25 08:57:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:53,159 INFO L93 Difference]: Finished difference Result 20738 states and 30496 transitions. [2019-11-25 08:57:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-25 08:57:53,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2019-11-25 08:57:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:53,173 INFO L225 Difference]: With dead ends: 20738 [2019-11-25 08:57:53,173 INFO L226 Difference]: Without dead ends: 18362 [2019-11-25 08:57:53,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 08:57:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2019-11-25 08:57:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 7847. [2019-11-25 08:57:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7847 states. [2019-11-25 08:57:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 11090 transitions. [2019-11-25 08:57:53,749 INFO L78 Accepts]: Start accepts. Automaton has 7847 states and 11090 transitions. Word has length 112 [2019-11-25 08:57:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:53,749 INFO L462 AbstractCegarLoop]: Abstraction has 7847 states and 11090 transitions. [2019-11-25 08:57:53,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 08:57:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7847 states and 11090 transitions. [2019-11-25 08:57:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:57:53,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:53,754 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-25 08:57:53,754 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 26877819, now seen corresponding path program 1 times [2019-11-25 08:57:53,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:53,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225606032] [2019-11-25 08:57:53,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:57:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:57:53,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:57:53,920 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:57:54,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:57:54 BoogieIcfgContainer [2019-11-25 08:57:54,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:57:54,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:57:54,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:57:54,072 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:57:54,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30" (3/4) ... [2019-11-25 08:57:54,074 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:57:54,239 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ca7904a5-078c-4bdf-bb4f-7d8715682ba7/bin/uautomizer/witness.graphml [2019-11-25 08:57:54,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:57:54,240 INFO L168 Benchmark]: Toolchain (without parser) took 25343.41 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,241 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:54,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.84 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-25 08:57:54,242 INFO L168 Benchmark]: Boogie Preprocessor took 75.96 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,242 INFO L168 Benchmark]: RCFGBuilder took 1171.64 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: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,242 INFO L168 Benchmark]: TraceAbstraction took 23215.36 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -171.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,243 INFO L168 Benchmark]: Witness Printer took 167.87 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:54,244 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 633.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.84 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 75.96 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1171.64 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: 92.8 MB). Peak memory consumption was 92.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23215.36 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -171.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 167.87 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 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; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 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; [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; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L16] port_t p13 = 0; [L20] port_t p21 = 0; [L24] port_t p23 = 0; [L28] port_t p31 = 0; [L32] port_t p32 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; 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: 23.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9737 SDtfs, 11360 SDslu, 14204 SDs, 0 SdLazy, 3192 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.9s 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 20459 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s 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...