./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/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 5502f9672f054c34b790763a9f35b59444705f97 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:15:20,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:15:20,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:15:20,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:15:20,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:15:20,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:15:20,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:15:20,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:15:20,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:15:20,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:15:20,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:15:20,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:15:20,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:15:20,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:15:20,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:15:20,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:15:20,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:15:20,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:15:20,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:15:20,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:15:20,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:15:20,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:15:20,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:15:20,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:15:20,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:15:20,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:15:20,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:15:20,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:15:20,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:15:20,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:15:20,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:15:20,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:15:20,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:15:20,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:15:20,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:15:20,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:15:20,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:15:20,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:15:20,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:15:20,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:15:20,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:15:20,912 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:15:20,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:15:20,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:15:20,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:15:20,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:15:20,930 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:15:20,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:15:20,931 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:15:20,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:15:20,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:15:20,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:15:20,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:15:20,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:15:20,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:15:20,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:15:20,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:15:20,933 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:15:20,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:15:20,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:15:20,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:15:20,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:15:20,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:15:20,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:15:20,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:15:20,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:15:20,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:15:20,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:15:20,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:15:20,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:15:20,936 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_032415eb-1a7a-427b-b4b4-bc8805adb5a3/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 -> 5502f9672f054c34b790763a9f35b59444705f97 [2019-11-16 00:15:20,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:15:21,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:15:21,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:15:21,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:15:21,016 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:15:21,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-16 00:15:21,089 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/data/5763c43fe/30d22ba50e8c40a58567881f0a592b1d/FLAG6e5dbf61c [2019-11-16 00:15:21,628 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:15:21,631 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-16 00:15:21,651 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/data/5763c43fe/30d22ba50e8c40a58567881f0a592b1d/FLAG6e5dbf61c [2019-11-16 00:15:21,838 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/data/5763c43fe/30d22ba50e8c40a58567881f0a592b1d [2019-11-16 00:15:21,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:15:21,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:15:21,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:15:21,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:15:21,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:15:21,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:15:21" (1/1) ... [2019-11-16 00:15:21,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:21, skipping insertion in model container [2019-11-16 00:15:21,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:15:21" (1/1) ... [2019-11-16 00:15:21,860 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:15:21,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:15:22,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:15:22,417 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:15:22,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:15:22,583 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:15:22,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22 WrapperNode [2019-11-16 00:15:22,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:15:22,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:15:22,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:15:22,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:15:22,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:15:22,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:15:22,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:15:22,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:15:22,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:15:22,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:15:22,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:15:22,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:15:22,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/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-16 00:15:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:15:22,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:15:24,290 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:15:24,290 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:15:24,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:24 BoogieIcfgContainer [2019-11-16 00:15:24,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:15:24,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:15:24,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:15:24,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:15:24,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:15:21" (1/3) ... [2019-11-16 00:15:24,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe9d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:15:24, skipping insertion in model container [2019-11-16 00:15:24,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (2/3) ... [2019-11-16 00:15:24,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe9d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:15:24, skipping insertion in model container [2019-11-16 00:15:24,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:24" (3/3) ... [2019-11-16 00:15:24,301 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-16 00:15:24,314 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:15:24,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-16 00:15:24,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-16 00:15:24,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:15:24,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:15:24,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:15:24,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:15:24,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:15:24,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:15:24,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:15:24,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:15:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2019-11-16 00:15:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:15:24,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:24,406 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:24,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1276327155, now seen corresponding path program 1 times [2019-11-16 00:15:24,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418797583] [2019-11-16 00:15:24,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:25,150 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-16 00:15:25,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418797583] [2019-11-16 00:15:25,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:25,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:25,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690026859] [2019-11-16 00:15:25,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:25,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:25,178 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 4 states. [2019-11-16 00:15:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:25,379 INFO L93 Difference]: Finished difference Result 782 states and 1378 transitions. [2019-11-16 00:15:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:25,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:15:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:25,412 INFO L225 Difference]: With dead ends: 782 [2019-11-16 00:15:25,412 INFO L226 Difference]: Without dead ends: 515 [2019-11-16 00:15:25,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-16 00:15:25,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 492. [2019-11-16 00:15:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-16 00:15:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 718 transitions. [2019-11-16 00:15:25,593 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 718 transitions. Word has length 98 [2019-11-16 00:15:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:25,595 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 718 transitions. [2019-11-16 00:15:25,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 718 transitions. [2019-11-16 00:15:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:15:25,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:25,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:25,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1180437433, now seen corresponding path program 1 times [2019-11-16 00:15:25,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:25,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87982064] [2019-11-16 00:15:25,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:25,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:25,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:25,757 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-16 00:15:25,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87982064] [2019-11-16 00:15:25,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:25,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:25,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496481288] [2019-11-16 00:15:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:25,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:25,763 INFO L87 Difference]: Start difference. First operand 492 states and 718 transitions. Second operand 3 states. [2019-11-16 00:15:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:25,827 INFO L93 Difference]: Finished difference Result 1438 states and 2092 transitions. [2019-11-16 00:15:25,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:25,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:15:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:25,837 INFO L225 Difference]: With dead ends: 1438 [2019-11-16 00:15:25,837 INFO L226 Difference]: Without dead ends: 974 [2019-11-16 00:15:25,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-16 00:15:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 494. [2019-11-16 00:15:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-16 00:15:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 720 transitions. [2019-11-16 00:15:25,893 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 720 transitions. Word has length 99 [2019-11-16 00:15:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:25,894 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 720 transitions. [2019-11-16 00:15:25,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 720 transitions. [2019-11-16 00:15:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:15:25,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:25,898 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:25,898 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -56994056, now seen corresponding path program 1 times [2019-11-16 00:15:25,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:25,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085724656] [2019-11-16 00:15:25,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:25,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:25,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:26,052 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-16 00:15:26,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085724656] [2019-11-16 00:15:26,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:26,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:26,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554593596] [2019-11-16 00:15:26,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:26,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:26,054 INFO L87 Difference]: Start difference. First operand 494 states and 720 transitions. Second operand 3 states. [2019-11-16 00:15:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:26,122 INFO L93 Difference]: Finished difference Result 1025 states and 1550 transitions. [2019-11-16 00:15:26,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:26,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-16 00:15:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:26,127 INFO L225 Difference]: With dead ends: 1025 [2019-11-16 00:15:26,127 INFO L226 Difference]: Without dead ends: 658 [2019-11-16 00:15:26,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-16 00:15:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2019-11-16 00:15:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-16 00:15:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 964 transitions. [2019-11-16 00:15:26,164 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 964 transitions. Word has length 100 [2019-11-16 00:15:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:26,164 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 964 transitions. [2019-11-16 00:15:26,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 964 transitions. [2019-11-16 00:15:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:15:26,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:26,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:26,167 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 329606004, now seen corresponding path program 1 times [2019-11-16 00:15:26,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:26,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97684227] [2019-11-16 00:15:26,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:26,333 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-16 00:15:26,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97684227] [2019-11-16 00:15:26,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:26,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:26,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504167925] [2019-11-16 00:15:26,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:26,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:26,337 INFO L87 Difference]: Start difference. First operand 642 states and 964 transitions. Second operand 4 states. [2019-11-16 00:15:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:26,405 INFO L93 Difference]: Finished difference Result 1270 states and 1907 transitions. [2019-11-16 00:15:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:26,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-16 00:15:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:26,410 INFO L225 Difference]: With dead ends: 1270 [2019-11-16 00:15:26,410 INFO L226 Difference]: Without dead ends: 642 [2019-11-16 00:15:26,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-16 00:15:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 641. [2019-11-16 00:15:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-16 00:15:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 961 transitions. [2019-11-16 00:15:26,447 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 961 transitions. Word has length 100 [2019-11-16 00:15:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:26,447 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 961 transitions. [2019-11-16 00:15:26,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 961 transitions. [2019-11-16 00:15:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:15:26,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:26,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:26,449 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 902258575, now seen corresponding path program 1 times [2019-11-16 00:15:26,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:26,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344409594] [2019-11-16 00:15:26,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:26,522 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-16 00:15:26,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344409594] [2019-11-16 00:15:26,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:26,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:26,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310121998] [2019-11-16 00:15:26,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:26,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:26,527 INFO L87 Difference]: Start difference. First operand 641 states and 961 transitions. Second operand 3 states. [2019-11-16 00:15:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:26,624 INFO L93 Difference]: Finished difference Result 1685 states and 2547 transitions. [2019-11-16 00:15:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:26,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-16 00:15:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:26,633 INFO L225 Difference]: With dead ends: 1685 [2019-11-16 00:15:26,634 INFO L226 Difference]: Without dead ends: 1236 [2019-11-16 00:15:26,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-16 00:15:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1215. [2019-11-16 00:15:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-11-16 00:15:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1811 transitions. [2019-11-16 00:15:26,702 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1811 transitions. Word has length 100 [2019-11-16 00:15:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:26,703 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 1811 transitions. [2019-11-16 00:15:26,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1811 transitions. [2019-11-16 00:15:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:15:26,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:26,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:26,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash -682838228, now seen corresponding path program 1 times [2019-11-16 00:15:26,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:26,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443242341] [2019-11-16 00:15:26,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:26,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:26,834 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-16 00:15:26,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443242341] [2019-11-16 00:15:26,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:26,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:26,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380565686] [2019-11-16 00:15:26,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:26,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:26,838 INFO L87 Difference]: Start difference. First operand 1215 states and 1811 transitions. Second operand 4 states. [2019-11-16 00:15:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:26,924 INFO L93 Difference]: Finished difference Result 1969 states and 2956 transitions. [2019-11-16 00:15:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:26,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-16 00:15:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:26,932 INFO L225 Difference]: With dead ends: 1969 [2019-11-16 00:15:26,932 INFO L226 Difference]: Without dead ends: 934 [2019-11-16 00:15:26,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-16 00:15:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-16 00:15:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-16 00:15:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1384 transitions. [2019-11-16 00:15:26,990 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1384 transitions. Word has length 100 [2019-11-16 00:15:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:26,991 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1384 transitions. [2019-11-16 00:15:26,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1384 transitions. [2019-11-16 00:15:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:15:26,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:26,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:26,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash -569395796, now seen corresponding path program 1 times [2019-11-16 00:15:27,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:27,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333287236] [2019-11-16 00:15:27,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:27,075 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-16 00:15:27,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333287236] [2019-11-16 00:15:27,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:27,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:27,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698245257] [2019-11-16 00:15:27,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:27,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:27,078 INFO L87 Difference]: Start difference. First operand 934 states and 1384 transitions. Second operand 3 states. [2019-11-16 00:15:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:27,208 INFO L93 Difference]: Finished difference Result 2030 states and 3126 transitions. [2019-11-16 00:15:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:27,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-16 00:15:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:27,219 INFO L225 Difference]: With dead ends: 2030 [2019-11-16 00:15:27,220 INFO L226 Difference]: Without dead ends: 1362 [2019-11-16 00:15:27,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2019-11-16 00:15:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1318. [2019-11-16 00:15:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-11-16 00:15:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2007 transitions. [2019-11-16 00:15:27,303 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2007 transitions. Word has length 102 [2019-11-16 00:15:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:27,304 INFO L462 AbstractCegarLoop]: Abstraction has 1318 states and 2007 transitions. [2019-11-16 00:15:27,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2007 transitions. [2019-11-16 00:15:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:15:27,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:27,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:27,306 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1182950444, now seen corresponding path program 1 times [2019-11-16 00:15:27,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:27,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040172990] [2019-11-16 00:15:27,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:27,492 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-16 00:15:27,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040172990] [2019-11-16 00:15:27,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:27,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:27,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978858936] [2019-11-16 00:15:27,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:27,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:27,494 INFO L87 Difference]: Start difference. First operand 1318 states and 2007 transitions. Second operand 4 states. [2019-11-16 00:15:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:27,684 INFO L93 Difference]: Finished difference Result 3354 states and 5117 transitions. [2019-11-16 00:15:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:27,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-16 00:15:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:27,697 INFO L225 Difference]: With dead ends: 3354 [2019-11-16 00:15:27,697 INFO L226 Difference]: Without dead ends: 2063 [2019-11-16 00:15:27,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-11-16 00:15:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2048. [2019-11-16 00:15:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-11-16 00:15:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3109 transitions. [2019-11-16 00:15:27,831 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3109 transitions. Word has length 103 [2019-11-16 00:15:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:27,832 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 3109 transitions. [2019-11-16 00:15:27,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3109 transitions. [2019-11-16 00:15:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:15:27,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:27,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:27,835 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 499752606, now seen corresponding path program 1 times [2019-11-16 00:15:27,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:27,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598509485] [2019-11-16 00:15:27,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:27,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:27,905 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-16 00:15:27,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598509485] [2019-11-16 00:15:27,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:27,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:27,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251895353] [2019-11-16 00:15:27,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:27,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:27,907 INFO L87 Difference]: Start difference. First operand 2048 states and 3109 transitions. Second operand 3 states. [2019-11-16 00:15:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:28,108 INFO L93 Difference]: Finished difference Result 4814 states and 7397 transitions. [2019-11-16 00:15:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:28,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-16 00:15:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:28,131 INFO L225 Difference]: With dead ends: 4814 [2019-11-16 00:15:28,132 INFO L226 Difference]: Without dead ends: 3121 [2019-11-16 00:15:28,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2019-11-16 00:15:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3108. [2019-11-16 00:15:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2019-11-16 00:15:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4693 transitions. [2019-11-16 00:15:28,429 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4693 transitions. Word has length 105 [2019-11-16 00:15:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:28,429 INFO L462 AbstractCegarLoop]: Abstraction has 3108 states and 4693 transitions. [2019-11-16 00:15:28,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4693 transitions. [2019-11-16 00:15:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:15:28,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:28,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:28,436 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1602371620, now seen corresponding path program 1 times [2019-11-16 00:15:28,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:28,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251343559] [2019-11-16 00:15:28,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:28,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:28,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:28,504 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-16 00:15:28,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251343559] [2019-11-16 00:15:28,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:28,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:28,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921807836] [2019-11-16 00:15:28,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:28,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:28,508 INFO L87 Difference]: Start difference. First operand 3108 states and 4693 transitions. Second operand 3 states. [2019-11-16 00:15:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:28,806 INFO L93 Difference]: Finished difference Result 7808 states and 12102 transitions. [2019-11-16 00:15:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:28,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-16 00:15:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:28,837 INFO L225 Difference]: With dead ends: 7808 [2019-11-16 00:15:28,838 INFO L226 Difference]: Without dead ends: 5032 [2019-11-16 00:15:28,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2019-11-16 00:15:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4826. [2019-11-16 00:15:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4826 states. [2019-11-16 00:15:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 7456 transitions. [2019-11-16 00:15:29,168 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 7456 transitions. Word has length 107 [2019-11-16 00:15:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 4826 states and 7456 transitions. [2019-11-16 00:15:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 7456 transitions. [2019-11-16 00:15:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:15:29,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:29,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:29,172 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1761194430, now seen corresponding path program 1 times [2019-11-16 00:15:29,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:29,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423855025] [2019-11-16 00:15:29,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:29,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:29,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:29,246 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-16 00:15:29,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423855025] [2019-11-16 00:15:29,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:29,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:29,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655270263] [2019-11-16 00:15:29,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:29,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:29,249 INFO L87 Difference]: Start difference. First operand 4826 states and 7456 transitions. Second operand 3 states. [2019-11-16 00:15:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:29,939 INFO L93 Difference]: Finished difference Result 13613 states and 21275 transitions. [2019-11-16 00:15:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:29,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-16 00:15:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:29,999 INFO L225 Difference]: With dead ends: 13613 [2019-11-16 00:15:29,999 INFO L226 Difference]: Without dead ends: 9343 [2019-11-16 00:15:30,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9343 states. [2019-11-16 00:15:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9343 to 9271. [2019-11-16 00:15:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9271 states. [2019-11-16 00:15:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9271 states to 9271 states and 14362 transitions. [2019-11-16 00:15:30,580 INFO L78 Accepts]: Start accepts. Automaton has 9271 states and 14362 transitions. Word has length 108 [2019-11-16 00:15:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:30,580 INFO L462 AbstractCegarLoop]: Abstraction has 9271 states and 14362 transitions. [2019-11-16 00:15:30,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9271 states and 14362 transitions. [2019-11-16 00:15:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:15:30,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:30,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:30,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1561444797, now seen corresponding path program 1 times [2019-11-16 00:15:30,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:30,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366640567] [2019-11-16 00:15:30,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:30,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:30,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:30,879 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-16 00:15:30,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366640567] [2019-11-16 00:15:30,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:30,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:30,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474959519] [2019-11-16 00:15:30,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:30,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:30,882 INFO L87 Difference]: Start difference. First operand 9271 states and 14362 transitions. Second operand 4 states. [2019-11-16 00:15:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:31,689 INFO L93 Difference]: Finished difference Result 25944 states and 40109 transitions. [2019-11-16 00:15:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:31,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:15:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:31,732 INFO L225 Difference]: With dead ends: 25944 [2019-11-16 00:15:31,732 INFO L226 Difference]: Without dead ends: 16712 [2019-11-16 00:15:31,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16712 states. [2019-11-16 00:15:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16712 to 16640. [2019-11-16 00:15:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16640 states. [2019-11-16 00:15:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 25493 transitions. [2019-11-16 00:15:32,662 INFO L78 Accepts]: Start accepts. Automaton has 16640 states and 25493 transitions. Word has length 108 [2019-11-16 00:15:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:32,662 INFO L462 AbstractCegarLoop]: Abstraction has 16640 states and 25493 transitions. [2019-11-16 00:15:32,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16640 states and 25493 transitions. [2019-11-16 00:15:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:15:32,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:32,668 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:32,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:32,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1148788313, now seen corresponding path program 1 times [2019-11-16 00:15:32,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:32,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954908122] [2019-11-16 00:15:32,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:32,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:32,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:32,708 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-16 00:15:32,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954908122] [2019-11-16 00:15:32,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:32,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:32,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679522197] [2019-11-16 00:15:32,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:32,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:32,710 INFO L87 Difference]: Start difference. First operand 16640 states and 25493 transitions. Second operand 3 states. [2019-11-16 00:15:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:33,880 INFO L93 Difference]: Finished difference Result 49722 states and 76224 transitions. [2019-11-16 00:15:33,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:33,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-16 00:15:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:33,951 INFO L225 Difference]: With dead ends: 49722 [2019-11-16 00:15:33,951 INFO L226 Difference]: Without dead ends: 33190 [2019-11-16 00:15:33,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33190 states. [2019-11-16 00:15:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33190 to 16646. [2019-11-16 00:15:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2019-11-16 00:15:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 25499 transitions. [2019-11-16 00:15:35,095 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 25499 transitions. Word has length 109 [2019-11-16 00:15:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:35,095 INFO L462 AbstractCegarLoop]: Abstraction has 16646 states and 25499 transitions. [2019-11-16 00:15:35,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 25499 transitions. [2019-11-16 00:15:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:15:35,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:35,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:35,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash -248848316, now seen corresponding path program 1 times [2019-11-16 00:15:35,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:35,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228089030] [2019-11-16 00:15:35,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:35,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:35,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:35,198 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-16 00:15:35,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228089030] [2019-11-16 00:15:35,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:35,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:35,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560162491] [2019-11-16 00:15:35,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:35,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:35,200 INFO L87 Difference]: Start difference. First operand 16646 states and 25499 transitions. Second operand 4 states. [2019-11-16 00:15:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:35,812 INFO L93 Difference]: Finished difference Result 33182 states and 50857 transitions. [2019-11-16 00:15:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:35,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-16 00:15:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:35,844 INFO L225 Difference]: With dead ends: 33182 [2019-11-16 00:15:35,844 INFO L226 Difference]: Without dead ends: 16646 [2019-11-16 00:15:35,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16646 states. [2019-11-16 00:15:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16646 to 16643. [2019-11-16 00:15:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16643 states. [2019-11-16 00:15:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16643 states to 16643 states and 25492 transitions. [2019-11-16 00:15:36,646 INFO L78 Accepts]: Start accepts. Automaton has 16643 states and 25492 transitions. Word has length 110 [2019-11-16 00:15:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:36,647 INFO L462 AbstractCegarLoop]: Abstraction has 16643 states and 25492 transitions. [2019-11-16 00:15:36,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16643 states and 25492 transitions. [2019-11-16 00:15:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:15:36,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:36,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:36,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1186160317, now seen corresponding path program 1 times [2019-11-16 00:15:36,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:36,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492120482] [2019-11-16 00:15:36,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:36,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:36,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:36,732 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-16 00:15:36,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492120482] [2019-11-16 00:15:36,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:36,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:36,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130617299] [2019-11-16 00:15:36,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:36,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:36,735 INFO L87 Difference]: Start difference. First operand 16643 states and 25492 transitions. Second operand 3 states. [2019-11-16 00:15:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:38,310 INFO L93 Difference]: Finished difference Result 45651 states and 70028 transitions. [2019-11-16 00:15:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:38,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-16 00:15:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:38,356 INFO L225 Difference]: With dead ends: 45651 [2019-11-16 00:15:38,357 INFO L226 Difference]: Without dead ends: 30041 [2019-11-16 00:15:38,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30041 states. [2019-11-16 00:15:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30041 to 29969. [2019-11-16 00:15:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29969 states. [2019-11-16 00:15:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29969 states to 29969 states and 45316 transitions. [2019-11-16 00:15:39,679 INFO L78 Accepts]: Start accepts. Automaton has 29969 states and 45316 transitions. Word has length 110 [2019-11-16 00:15:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:39,679 INFO L462 AbstractCegarLoop]: Abstraction has 29969 states and 45316 transitions. [2019-11-16 00:15:39,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29969 states and 45316 transitions. [2019-11-16 00:15:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-16 00:15:39,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:39,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:39,694 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 308743968, now seen corresponding path program 1 times [2019-11-16 00:15:39,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:39,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198896440] [2019-11-16 00:15:39,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:39,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:39,816 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-16 00:15:39,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198896440] [2019-11-16 00:15:39,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:39,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:39,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790466237] [2019-11-16 00:15:39,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:39,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:39,819 INFO L87 Difference]: Start difference. First operand 29969 states and 45316 transitions. Second operand 4 states. [2019-11-16 00:15:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:41,352 INFO L93 Difference]: Finished difference Result 53113 states and 80533 transitions. [2019-11-16 00:15:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:41,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-16 00:15:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:41,394 INFO L225 Difference]: With dead ends: 53113 [2019-11-16 00:15:41,395 INFO L226 Difference]: Without dead ends: 24031 [2019-11-16 00:15:41,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24031 states. [2019-11-16 00:15:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24031 to 24031. [2019-11-16 00:15:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24031 states. [2019-11-16 00:15:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24031 states to 24031 states and 36258 transitions. [2019-11-16 00:15:42,752 INFO L78 Accepts]: Start accepts. Automaton has 24031 states and 36258 transitions. Word has length 110 [2019-11-16 00:15:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:42,752 INFO L462 AbstractCegarLoop]: Abstraction has 24031 states and 36258 transitions. [2019-11-16 00:15:42,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24031 states and 36258 transitions. [2019-11-16 00:15:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-16 00:15:42,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:42,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:42,759 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1247226342, now seen corresponding path program 1 times [2019-11-16 00:15:42,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:42,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583076423] [2019-11-16 00:15:42,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:42,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:42,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:42,993 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-16 00:15:42,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583076423] [2019-11-16 00:15:42,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:42,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:15:42,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233390160] [2019-11-16 00:15:42,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:15:42,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:42,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:15:42,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:15:42,995 INFO L87 Difference]: Start difference. First operand 24031 states and 36258 transitions. Second operand 8 states. [2019-11-16 00:15:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:44,068 INFO L93 Difference]: Finished difference Result 44347 states and 68127 transitions. [2019-11-16 00:15:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:44,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2019-11-16 00:15:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:44,099 INFO L225 Difference]: With dead ends: 44347 [2019-11-16 00:15:44,100 INFO L226 Difference]: Without dead ends: 24127 [2019-11-16 00:15:44,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:15:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24127 states. [2019-11-16 00:15:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24127 to 24127. [2019-11-16 00:15:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24127 states. [2019-11-16 00:15:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24127 states to 24127 states and 36202 transitions. [2019-11-16 00:15:45,187 INFO L78 Accepts]: Start accepts. Automaton has 24127 states and 36202 transitions. Word has length 113 [2019-11-16 00:15:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:45,188 INFO L462 AbstractCegarLoop]: Abstraction has 24127 states and 36202 transitions. [2019-11-16 00:15:45,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:15:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 24127 states and 36202 transitions. [2019-11-16 00:15:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-16 00:15:45,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:45,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:45,195 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1602851438, now seen corresponding path program 1 times [2019-11-16 00:15:45,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:45,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493114444] [2019-11-16 00:15:45,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:45,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:45,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:45,347 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-16 00:15:45,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493114444] [2019-11-16 00:15:45,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:45,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:45,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863413859] [2019-11-16 00:15:45,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:45,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:45,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:45,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:45,350 INFO L87 Difference]: Start difference. First operand 24127 states and 36202 transitions. Second operand 4 states. [2019-11-16 00:15:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:46,782 INFO L93 Difference]: Finished difference Result 39572 states and 59514 transitions. [2019-11-16 00:15:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:46,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-16 00:15:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:46,804 INFO L225 Difference]: With dead ends: 39572 [2019-11-16 00:15:46,804 INFO L226 Difference]: Without dead ends: 22410 [2019-11-16 00:15:46,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22410 states. [2019-11-16 00:15:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22410 to 22320. [2019-11-16 00:15:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22320 states. [2019-11-16 00:15:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22320 states to 22320 states and 33467 transitions. [2019-11-16 00:15:47,893 INFO L78 Accepts]: Start accepts. Automaton has 22320 states and 33467 transitions. Word has length 113 [2019-11-16 00:15:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:47,893 INFO L462 AbstractCegarLoop]: Abstraction has 22320 states and 33467 transitions. [2019-11-16 00:15:47,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22320 states and 33467 transitions. [2019-11-16 00:15:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:15:47,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:47,898 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:47,898 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -684328491, now seen corresponding path program 1 times [2019-11-16 00:15:47,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:47,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555754809] [2019-11-16 00:15:47,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:47,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:47,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:15:48,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555754809] [2019-11-16 00:15:48,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:48,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:48,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069672916] [2019-11-16 00:15:48,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:48,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:48,015 INFO L87 Difference]: Start difference. First operand 22320 states and 33467 transitions. Second operand 4 states. [2019-11-16 00:15:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:49,407 INFO L93 Difference]: Finished difference Result 44837 states and 67188 transitions. [2019-11-16 00:15:49,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:49,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-16 00:15:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:49,430 INFO L225 Difference]: With dead ends: 44837 [2019-11-16 00:15:49,430 INFO L226 Difference]: Without dead ends: 22672 [2019-11-16 00:15:49,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22672 states. [2019-11-16 00:15:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22672 to 22480. [2019-11-16 00:15:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22480 states. [2019-11-16 00:15:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22480 states to 22480 states and 33642 transitions. [2019-11-16 00:15:50,398 INFO L78 Accepts]: Start accepts. Automaton has 22480 states and 33642 transitions. Word has length 115 [2019-11-16 00:15:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:50,398 INFO L462 AbstractCegarLoop]: Abstraction has 22480 states and 33642 transitions. [2019-11-16 00:15:50,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22480 states and 33642 transitions. [2019-11-16 00:15:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:15:50,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:50,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:50,403 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash 64900185, now seen corresponding path program 1 times [2019-11-16 00:15:50,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:50,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372485397] [2019-11-16 00:15:50,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:50,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:50,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:50,442 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-16 00:15:50,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372485397] [2019-11-16 00:15:50,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:50,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:15:50,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440328974] [2019-11-16 00:15:50,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:15:50,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:15:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:50,444 INFO L87 Difference]: Start difference. First operand 22480 states and 33642 transitions. Second operand 3 states. [2019-11-16 00:15:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:52,663 INFO L93 Difference]: Finished difference Result 61013 states and 91547 transitions. [2019-11-16 00:15:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:15:52,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-16 00:15:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:52,708 INFO L225 Difference]: With dead ends: 61013 [2019-11-16 00:15:52,708 INFO L226 Difference]: Without dead ends: 44753 [2019-11-16 00:15:52,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:15:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44753 states. [2019-11-16 00:15:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44753 to 22490. [2019-11-16 00:15:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22490 states. [2019-11-16 00:15:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22490 states to 22490 states and 33652 transitions. [2019-11-16 00:15:53,904 INFO L78 Accepts]: Start accepts. Automaton has 22490 states and 33652 transitions. Word has length 116 [2019-11-16 00:15:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:53,905 INFO L462 AbstractCegarLoop]: Abstraction has 22490 states and 33652 transitions. [2019-11-16 00:15:53,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:15:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22490 states and 33652 transitions. [2019-11-16 00:15:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:15:53,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:53,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:53,910 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash -426513610, now seen corresponding path program 1 times [2019-11-16 00:15:53,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:53,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756628689] [2019-11-16 00:15:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:54,000 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-16 00:15:54,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756628689] [2019-11-16 00:15:54,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:54,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:54,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670075884] [2019-11-16 00:15:54,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:15:54,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:15:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:54,002 INFO L87 Difference]: Start difference. First operand 22490 states and 33652 transitions. Second operand 5 states. [2019-11-16 00:15:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:55,391 INFO L93 Difference]: Finished difference Result 41623 states and 62741 transitions. [2019-11-16 00:15:55,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:15:55,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-16 00:15:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:55,414 INFO L225 Difference]: With dead ends: 41623 [2019-11-16 00:15:55,415 INFO L226 Difference]: Without dead ends: 22490 [2019-11-16 00:15:55,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:15:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2019-11-16 00:15:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 22490. [2019-11-16 00:15:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22490 states. [2019-11-16 00:15:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22490 states to 22490 states and 33396 transitions. [2019-11-16 00:15:56,801 INFO L78 Accepts]: Start accepts. Automaton has 22490 states and 33396 transitions. Word has length 117 [2019-11-16 00:15:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:56,801 INFO L462 AbstractCegarLoop]: Abstraction has 22490 states and 33396 transitions. [2019-11-16 00:15:56,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:15:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22490 states and 33396 transitions. [2019-11-16 00:15:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:15:56,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:56,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:56,807 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1750980389, now seen corresponding path program 1 times [2019-11-16 00:15:56,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:56,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651282312] [2019-11-16 00:15:56,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:56,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:56,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:56,919 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-16 00:15:56,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651282312] [2019-11-16 00:15:56,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:56,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:56,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393650107] [2019-11-16 00:15:56,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:56,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:56,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:56,922 INFO L87 Difference]: Start difference. First operand 22490 states and 33396 transitions. Second operand 4 states. [2019-11-16 00:15:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:58,520 INFO L93 Difference]: Finished difference Result 45279 states and 67141 transitions. [2019-11-16 00:15:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:58,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:15:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:15:58,544 INFO L225 Difference]: With dead ends: 45279 [2019-11-16 00:15:58,544 INFO L226 Difference]: Without dead ends: 23133 [2019-11-16 00:15:58,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:15:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23133 states. [2019-11-16 00:15:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23133 to 22810. [2019-11-16 00:15:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22810 states. [2019-11-16 00:15:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22810 states to 22810 states and 33741 transitions. [2019-11-16 00:15:59,801 INFO L78 Accepts]: Start accepts. Automaton has 22810 states and 33741 transitions. Word has length 117 [2019-11-16 00:15:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:15:59,802 INFO L462 AbstractCegarLoop]: Abstraction has 22810 states and 33741 transitions. [2019-11-16 00:15:59,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:15:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22810 states and 33741 transitions. [2019-11-16 00:15:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:15:59,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:15:59,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:59,807 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:15:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2053868748, now seen corresponding path program 1 times [2019-11-16 00:15:59,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:59,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578400453] [2019-11-16 00:15:59,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:59,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:59,901 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-16 00:15:59,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578400453] [2019-11-16 00:15:59,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:59,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:59,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950386634] [2019-11-16 00:15:59,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:15:59,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:59,905 INFO L87 Difference]: Start difference. First operand 22810 states and 33741 transitions. Second operand 4 states. [2019-11-16 00:16:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:01,398 INFO L93 Difference]: Finished difference Result 32590 states and 48423 transitions. [2019-11-16 00:16:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:16:01,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:16:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:01,416 INFO L225 Difference]: With dead ends: 32590 [2019-11-16 00:16:01,416 INFO L226 Difference]: Without dead ends: 20816 [2019-11-16 00:16:01,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20816 states. [2019-11-16 00:16:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20816 to 20813. [2019-11-16 00:16:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20813 states. [2019-11-16 00:16:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20813 states to 20813 states and 30802 transitions. [2019-11-16 00:16:02,532 INFO L78 Accepts]: Start accepts. Automaton has 20813 states and 30802 transitions. Word has length 117 [2019-11-16 00:16:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:02,532 INFO L462 AbstractCegarLoop]: Abstraction has 20813 states and 30802 transitions. [2019-11-16 00:16:02,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:16:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 20813 states and 30802 transitions. [2019-11-16 00:16:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:16:02,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:02,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:02,537 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1756219013, now seen corresponding path program 1 times [2019-11-16 00:16:02,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:02,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967968592] [2019-11-16 00:16:02,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:02,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:02,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:16:04,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967968592] [2019-11-16 00:16:04,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:04,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-16 00:16:04,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240083556] [2019-11-16 00:16:04,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:16:04,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:16:04,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:16:04,033 INFO L87 Difference]: Start difference. First operand 20813 states and 30802 transitions. Second operand 23 states. [2019-11-16 00:16:04,573 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-16 00:16:04,851 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-16 00:16:05,009 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-16 00:16:05,213 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:16:05,383 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-16 00:16:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:09,806 INFO L93 Difference]: Finished difference Result 56871 states and 85995 transitions. [2019-11-16 00:16:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:16:09,807 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-16 00:16:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:09,862 INFO L225 Difference]: With dead ends: 56871 [2019-11-16 00:16:09,862 INFO L226 Difference]: Without dead ends: 38774 [2019-11-16 00:16:09,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:16:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38774 states. [2019-11-16 00:16:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38774 to 20022. [2019-11-16 00:16:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20022 states. [2019-11-16 00:16:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20022 states to 20022 states and 29871 transitions. [2019-11-16 00:16:11,550 INFO L78 Accepts]: Start accepts. Automaton has 20022 states and 29871 transitions. Word has length 119 [2019-11-16 00:16:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:11,550 INFO L462 AbstractCegarLoop]: Abstraction has 20022 states and 29871 transitions. [2019-11-16 00:16:11,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:16:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20022 states and 29871 transitions. [2019-11-16 00:16:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:16:11,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:11,554 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:11,554 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1483364393, now seen corresponding path program 1 times [2019-11-16 00:16:11,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:11,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237968225] [2019-11-16 00:16:11,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:11,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:11,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:16:11,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:16:11,741 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:16:11,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:16:11 BoogieIcfgContainer [2019-11-16 00:16:11,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:16:11,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:16:11,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:16:11,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:16:11,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:24" (3/4) ... [2019-11-16 00:16:11,930 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:16:12,140 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_032415eb-1a7a-427b-b4b4-bc8805adb5a3/bin/uautomizer/witness.graphml [2019-11-16 00:16:12,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:16:12,142 INFO L168 Benchmark]: Toolchain (without parser) took 50299.57 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 939.4 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,142 INFO L168 Benchmark]: CDTParser took 0.35 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-16 00:16:12,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,143 INFO L168 Benchmark]: Boogie Preprocessor took 61.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,144 INFO L168 Benchmark]: RCFGBuilder took 1563.56 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: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,144 INFO L168 Benchmark]: TraceAbstraction took 47633.10 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 998.3 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,144 INFO L168 Benchmark]: Witness Printer took 214.21 ms. Allocated memory is still 5.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:16:12,146 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.35 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 740.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1563.56 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: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47633.10 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 998.3 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 214.21 ms. Allocated memory is still 5.0 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1872; [L71] int __return_1528; [L72] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_uchar() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_uchar() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_uchar() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L134] COND TRUE !(init__r121 == 0) [L136] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L139] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1964] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1966] COND TRUE !(ep23 == 0) [L1968] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1941] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1943] COND TRUE !(ep31 == 0) [L1945] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L149] COND TRUE !(init__r231 == 0) [L151] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L154] COND TRUE !(init__r311 == 0) [L156] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1872] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1874] COND TRUE !(ep12 == 0) [L1876] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1248 = init__tmp___5 [L226] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 [L243] _Bool node1__newmax; [L244] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L251] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE !(newmax1 == 0) [L257] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L260] COND TRUE p12_new == nomsg [L262] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L266] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L279] mode1 = 1 [L281] _Bool node2__newmax; [L282] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L283] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L289] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L291] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L304] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L306] COND TRUE !(newmax2 == 0) [L308] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L309] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L311] COND TRUE p23_new == nomsg [L313] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, 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] [L315] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L317] mode2 = 1 [L319] _Bool node3__newmax; [L320] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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 FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L327] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L329] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L331] COND TRUE !(newmax3 == 0) [L333] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L334] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L336] COND TRUE p31_new == nomsg [L338] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, 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] [L340] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=3, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=4, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] mode3 = 1 [L356] p12_old = p12_new [L357] p12_new = nomsg [L358] p13_old = p13_new [L359] p13_new = nomsg [L360] p21_old = p21_new [L361] p21_new = nomsg [L362] p23_old = p23_new [L363] p23_new = nomsg [L364] p31_old = p31_new [L365] p31_new = nomsg [L366] p32_old = p32_new [L367] p32_new = nomsg [L369] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((int)r1) < 2 [L398] check__tmp = 1 [L399] __return_1394 = check__tmp [L400] main__c1 = __return_1394 [L402] _Bool __tmp_1; [L403] __tmp_1 = main__c1 [L404] _Bool assert__arg; [L405] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND FALSE !(assert__arg == 0) [L413] _Bool node1__newmax; [L414] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(r1 == 255) [L423] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L433] COND TRUE !(ep31 == 0) [L435] m1 = p31_old [L436] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=0, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=0, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L559] check__tmp = 0 [L560] __return_1872 = check__tmp [L561] main__c1 = __return_1872 [L563] _Bool __tmp_2; [L564] __tmp_2 = main__c1 [L565] _Bool assert__arg; [L566] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L567] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L569] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=4, id3=0, m1=0, m2=3, m3=4, max1=3, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12389 SDtfs, 12322 SDslu, 15988 SDs, 0 SdLazy, 2600 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29969occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 59205 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2715 NumberOfCodeBlocks, 2715 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1218951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...