./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/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 e3a9fbf61771579e3e5f979c3029cdc28b5b93f1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-678e011 [2019-11-20 09:08:52,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:08:52,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:08:52,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:08:52,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:08:52,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:08:52,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:08:52,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:08:52,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:08:52,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:08:52,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:08:52,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:08:52,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:08:52,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:08:52,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:08:52,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:08:52,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:08:52,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:08:52,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:08:52,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:08:52,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:08:52,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:08:52,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:08:52,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:08:53,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:08:53,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:08:53,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:08:53,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:08:53,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:08:53,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:08:53,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:08:53,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:08:53,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:08:53,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:08:53,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:08:53,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:08:53,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:08:53,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:08:53,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:08:53,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:08:53,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:08:53,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:08:53,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:08:53,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:08:53,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:08:53,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:08:53,043 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:08:53,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:08:53,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:08:53,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:08:53,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:08:53,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:08:53,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:08:53,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:08:53,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:08:53,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:08:53,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:08:53,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:08:53,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:08:53,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:08:53,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:08:53,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:08:53,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:08:53,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:08:53,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:08:53,047 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_886b7398-38b1-49b0-accb-1f7e463a0c2e/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 -> e3a9fbf61771579e3e5f979c3029cdc28b5b93f1 [2019-11-20 09:08:53,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:08:53,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:08:53,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:08:53,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:08:53,238 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:08:53,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 09:08:53,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/data/ccce05536/55150164726640508b4f38ffca01cd10/FLAG0de7a7360 [2019-11-20 09:08:53,740 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:08:53,741 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 09:08:53,762 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/data/ccce05536/55150164726640508b4f38ffca01cd10/FLAG0de7a7360 [2019-11-20 09:08:54,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/data/ccce05536/55150164726640508b4f38ffca01cd10 [2019-11-20 09:08:54,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:08:54,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:08:54,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:08:54,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:08:54,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:08:54,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719fed40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54, skipping insertion in model container [2019-11-20 09:08:54,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,063 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:08:54,130 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:08:54,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:08:54,554 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:08:54,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:08:54,705 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:08:54,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54 WrapperNode [2019-11-20 09:08:54,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:08:54,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:08:54,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:08:54,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:08:54,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:08:54,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:08:54,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:08:54,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:08:54,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... [2019-11-20 09:08:54,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:08:54,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:08:54,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:08:54,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:08:54,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/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-20 09:08:54,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:08:54,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:08:55,891 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:08:55,891 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 09:08:55,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:08:55 BoogieIcfgContainer [2019-11-20 09:08:55,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:08:55,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:08:55,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:08:55,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:08:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:08:54" (1/3) ... [2019-11-20 09:08:55,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d6d54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:08:55, skipping insertion in model container [2019-11-20 09:08:55,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:08:54" (2/3) ... [2019-11-20 09:08:55,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d6d54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:08:55, skipping insertion in model container [2019-11-20 09:08:55,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:08:55" (3/3) ... [2019-11-20 09:08:55,913 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 09:08:55,921 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:08:55,927 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:08:55,936 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:08:55,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:08:55,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:08:55,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:08:55,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:08:55,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:08:55,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:08:55,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:08:55,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:08:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-11-20 09:08:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 09:08:56,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:56,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:56,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1885524630, now seen corresponding path program 1 times [2019-11-20 09:08:56,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:56,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896652980] [2019-11-20 09:08:56,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:56,444 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-20 09:08:56,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896652980] [2019-11-20 09:08:56,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:56,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:08:56,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110672183] [2019-11-20 09:08:56,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:08:56,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:08:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:56,466 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-11-20 09:08:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:56,710 INFO L93 Difference]: Finished difference Result 452 states and 785 transitions. [2019-11-20 09:08:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:08:56,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 09:08:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:56,730 INFO L225 Difference]: With dead ends: 452 [2019-11-20 09:08:56,730 INFO L226 Difference]: Without dead ends: 334 [2019-11-20 09:08:56,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-20 09:08:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-11-20 09:08:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-20 09:08:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-11-20 09:08:56,799 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 95 [2019-11-20 09:08:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:56,800 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-11-20 09:08:56,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:08:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-11-20 09:08:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 09:08:56,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:56,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:56,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash -614138391, now seen corresponding path program 1 times [2019-11-20 09:08:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181993833] [2019-11-20 09:08:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:57,153 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-20 09:08:57,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181993833] [2019-11-20 09:08:57,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:57,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:08:57,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097407353] [2019-11-20 09:08:57,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:08:57,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:08:57,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:08:57,158 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 4 states. [2019-11-20 09:08:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:57,334 INFO L93 Difference]: Finished difference Result 965 states and 1470 transitions. [2019-11-20 09:08:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:08:57,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 09:08:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:57,342 INFO L225 Difference]: With dead ends: 965 [2019-11-20 09:08:57,343 INFO L226 Difference]: Without dead ends: 642 [2019-11-20 09:08:57,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:08:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-20 09:08:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-11-20 09:08:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-20 09:08:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 968 transitions. [2019-11-20 09:08:57,426 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 968 transitions. Word has length 95 [2019-11-20 09:08:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:57,428 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 968 transitions. [2019-11-20 09:08:57,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:08:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 968 transitions. [2019-11-20 09:08:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 09:08:57,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:57,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:57,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash -779319531, now seen corresponding path program 1 times [2019-11-20 09:08:57,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:57,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607866806] [2019-11-20 09:08:57,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:57,543 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-20 09:08:57,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607866806] [2019-11-20 09:08:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:08:57,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260428559] [2019-11-20 09:08:57,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:08:57,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:57,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:08:57,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:57,548 INFO L87 Difference]: Start difference. First operand 640 states and 968 transitions. Second operand 3 states. [2019-11-20 09:08:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:57,610 INFO L93 Difference]: Finished difference Result 1882 states and 2842 transitions. [2019-11-20 09:08:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:08:57,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 09:08:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:57,622 INFO L225 Difference]: With dead ends: 1882 [2019-11-20 09:08:57,622 INFO L226 Difference]: Without dead ends: 1270 [2019-11-20 09:08:57,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-20 09:08:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 642. [2019-11-20 09:08:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-20 09:08:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2019-11-20 09:08:57,666 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 96 [2019-11-20 09:08:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:57,667 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2019-11-20 09:08:57,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:08:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2019-11-20 09:08:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 09:08:57,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:57,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:57,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash -611891448, now seen corresponding path program 1 times [2019-11-20 09:08:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:57,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335830918] [2019-11-20 09:08:57,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:08:57,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335830918] [2019-11-20 09:08:57,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:57,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:08:57,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937861957] [2019-11-20 09:08:57,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:08:57,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:08:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:08:57,845 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand 4 states. [2019-11-20 09:08:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:57,914 INFO L93 Difference]: Finished difference Result 1274 states and 1926 transitions. [2019-11-20 09:08:57,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:08:57,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 09:08:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:57,920 INFO L225 Difference]: With dead ends: 1274 [2019-11-20 09:08:57,920 INFO L226 Difference]: Without dead ends: 640 [2019-11-20 09:08:57,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:08:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-20 09:08:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-11-20 09:08:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-20 09:08:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 966 transitions. [2019-11-20 09:08:57,998 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 966 transitions. Word has length 97 [2019-11-20 09:08:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:57,998 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 966 transitions. [2019-11-20 09:08:57,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:08:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 966 transitions. [2019-11-20 09:08:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 09:08:58,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:58,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:58,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -981864435, now seen corresponding path program 1 times [2019-11-20 09:08:58,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:58,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089598561] [2019-11-20 09:08:58,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:58,090 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-20 09:08:58,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089598561] [2019-11-20 09:08:58,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:58,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:08:58,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668018165] [2019-11-20 09:08:58,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:08:58,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:58,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:08:58,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:58,092 INFO L87 Difference]: Start difference. First operand 640 states and 966 transitions. Second operand 3 states. [2019-11-20 09:08:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:58,164 INFO L93 Difference]: Finished difference Result 1414 states and 2157 transitions. [2019-11-20 09:08:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:08:58,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 09:08:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:58,170 INFO L225 Difference]: With dead ends: 1414 [2019-11-20 09:08:58,171 INFO L226 Difference]: Without dead ends: 948 [2019-11-20 09:08:58,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-11-20 09:08:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 946. [2019-11-20 09:08:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-11-20 09:08:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1411 transitions. [2019-11-20 09:08:58,225 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1411 transitions. Word has length 97 [2019-11-20 09:08:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:58,226 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1411 transitions. [2019-11-20 09:08:58,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:08:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1411 transitions. [2019-11-20 09:08:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 09:08:58,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:58,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:58,228 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash -83426502, now seen corresponding path program 1 times [2019-11-20 09:08:58,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:58,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77355723] [2019-11-20 09:08:58,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:58,354 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-20 09:08:58,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77355723] [2019-11-20 09:08:58,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:58,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:08:58,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847231920] [2019-11-20 09:08:58,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:08:58,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:08:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:08:58,356 INFO L87 Difference]: Start difference. First operand 946 states and 1411 transitions. Second operand 4 states. [2019-11-20 09:08:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:58,498 INFO L93 Difference]: Finished difference Result 2376 states and 3546 transitions. [2019-11-20 09:08:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:08:58,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 09:08:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:58,509 INFO L225 Difference]: With dead ends: 2376 [2019-11-20 09:08:58,509 INFO L226 Difference]: Without dead ends: 1449 [2019-11-20 09:08:58,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:08:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-11-20 09:08:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2019-11-20 09:08:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-20 09:08:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2139 transitions. [2019-11-20 09:08:58,602 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2139 transitions. Word has length 99 [2019-11-20 09:08:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:58,602 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2139 transitions. [2019-11-20 09:08:58,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:08:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2139 transitions. [2019-11-20 09:08:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 09:08:58,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:58,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:58,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1303974225, now seen corresponding path program 1 times [2019-11-20 09:08:58,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:58,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510913309] [2019-11-20 09:08:58,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:58,719 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-20 09:08:58,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510913309] [2019-11-20 09:08:58,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:58,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:08:58,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081063633] [2019-11-20 09:08:58,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:08:58,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:58,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:08:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:08:58,722 INFO L87 Difference]: Start difference. First operand 1447 states and 2139 transitions. Second operand 4 states. [2019-11-20 09:08:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:58,818 INFO L93 Difference]: Finished difference Result 2507 states and 3725 transitions. [2019-11-20 09:08:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:08:58,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 09:08:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:58,826 INFO L225 Difference]: With dead ends: 2507 [2019-11-20 09:08:58,827 INFO L226 Difference]: Without dead ends: 1447 [2019-11-20 09:08:58,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:08:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-11-20 09:08:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2019-11-20 09:08:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-20 09:08:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2138 transitions. [2019-11-20 09:08:58,909 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2138 transitions. Word has length 101 [2019-11-20 09:08:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:58,909 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2138 transitions. [2019-11-20 09:08:58,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:08:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2138 transitions. [2019-11-20 09:08:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 09:08:58,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:58,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:58,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash 963915244, now seen corresponding path program 1 times [2019-11-20 09:08:58,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:58,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218149664] [2019-11-20 09:08:58,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:58,969 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-20 09:08:58,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218149664] [2019-11-20 09:08:58,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:58,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:08:58,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443492722] [2019-11-20 09:08:58,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:08:58,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:58,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:08:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:58,971 INFO L87 Difference]: Start difference. First operand 1447 states and 2138 transitions. Second operand 3 states. [2019-11-20 09:08:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:59,104 INFO L93 Difference]: Finished difference Result 3304 states and 4953 transitions. [2019-11-20 09:08:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:08:59,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 09:08:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:59,117 INFO L225 Difference]: With dead ends: 3304 [2019-11-20 09:08:59,117 INFO L226 Difference]: Without dead ends: 2196 [2019-11-20 09:08:59,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-11-20 09:08:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2194. [2019-11-20 09:08:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-11-20 09:08:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3218 transitions. [2019-11-20 09:08:59,263 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3218 transitions. Word has length 101 [2019-11-20 09:08:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:59,264 INFO L462 AbstractCegarLoop]: Abstraction has 2194 states and 3218 transitions. [2019-11-20 09:08:59,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:08:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3218 transitions. [2019-11-20 09:08:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 09:08:59,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:59,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:59,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1817525050, now seen corresponding path program 1 times [2019-11-20 09:08:59,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:59,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331576074] [2019-11-20 09:08:59,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:59,428 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-20 09:08:59,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331576074] [2019-11-20 09:08:59,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:08:59,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431518367] [2019-11-20 09:08:59,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:08:59,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:08:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:08:59,436 INFO L87 Difference]: Start difference. First operand 2194 states and 3218 transitions. Second operand 4 states. [2019-11-20 09:08:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:08:59,684 INFO L93 Difference]: Finished difference Result 6348 states and 9298 transitions. [2019-11-20 09:08:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:08:59,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 09:08:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:08:59,706 INFO L225 Difference]: With dead ends: 6348 [2019-11-20 09:08:59,707 INFO L226 Difference]: Without dead ends: 4193 [2019-11-20 09:08:59,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:08:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2019-11-20 09:08:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4191. [2019-11-20 09:08:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-11-20 09:08:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 6087 transitions. [2019-11-20 09:08:59,954 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 6087 transitions. Word has length 103 [2019-11-20 09:08:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:08:59,954 INFO L462 AbstractCegarLoop]: Abstraction has 4191 states and 6087 transitions. [2019-11-20 09:08:59,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:08:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 6087 transitions. [2019-11-20 09:08:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 09:08:59,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:08:59,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:08:59,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:08:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:08:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -399665424, now seen corresponding path program 1 times [2019-11-20 09:08:59,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:08:59,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393475468] [2019-11-20 09:08:59,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:08:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:08:59,992 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-20 09:08:59,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393475468] [2019-11-20 09:08:59,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:08:59,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:08:59,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655801726] [2019-11-20 09:08:59,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:08:59,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:08:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:08:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:08:59,994 INFO L87 Difference]: Start difference. First operand 4191 states and 6087 transitions. Second operand 3 states. [2019-11-20 09:09:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:00,348 INFO L93 Difference]: Finished difference Result 12389 states and 18020 transitions. [2019-11-20 09:09:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:09:00,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 09:09:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:00,390 INFO L225 Difference]: With dead ends: 12389 [2019-11-20 09:09:00,390 INFO L226 Difference]: Without dead ends: 8299 [2019-11-20 09:09:00,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-11-20 09:09:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 4197. [2019-11-20 09:09:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4197 states. [2019-11-20 09:09:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 6093 transitions. [2019-11-20 09:09:00,790 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 6093 transitions. Word has length 104 [2019-11-20 09:09:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:00,790 INFO L462 AbstractCegarLoop]: Abstraction has 4197 states and 6093 transitions. [2019-11-20 09:09:00,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:09:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 6093 transitions. [2019-11-20 09:09:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 09:09:00,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:00,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:00,797 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash -789174747, now seen corresponding path program 1 times [2019-11-20 09:09:00,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:00,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058152662] [2019-11-20 09:09:00,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:00,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-20 09:09:00,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058152662] [2019-11-20 09:09:00,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:00,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:00,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648848962] [2019-11-20 09:09:00,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:00,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:00,903 INFO L87 Difference]: Start difference. First operand 4197 states and 6093 transitions. Second operand 4 states. [2019-11-20 09:09:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:01,122 INFO L93 Difference]: Finished difference Result 8291 states and 12052 transitions. [2019-11-20 09:09:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:01,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 09:09:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:01,159 INFO L225 Difference]: With dead ends: 8291 [2019-11-20 09:09:01,160 INFO L226 Difference]: Without dead ends: 4197 [2019-11-20 09:09:01,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-11-20 09:09:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4194. [2019-11-20 09:09:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-20 09:09:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6086 transitions. [2019-11-20 09:09:01,394 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6086 transitions. Word has length 105 [2019-11-20 09:09:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:01,394 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6086 transitions. [2019-11-20 09:09:01,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6086 transitions. [2019-11-20 09:09:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 09:09:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:01,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:01,399 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1175492870, now seen corresponding path program 1 times [2019-11-20 09:09:01,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:01,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454009167] [2019-11-20 09:09:01,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:01,491 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-20 09:09:01,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454009167] [2019-11-20 09:09:01,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:01,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:09:01,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198199757] [2019-11-20 09:09:01,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:09:01,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:09:01,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:01,494 INFO L87 Difference]: Start difference. First operand 4194 states and 6086 transitions. Second operand 3 states. [2019-11-20 09:09:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:01,903 INFO L93 Difference]: Finished difference Result 10897 states and 15856 transitions. [2019-11-20 09:09:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:09:01,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 09:09:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:01,915 INFO L225 Difference]: With dead ends: 10897 [2019-11-20 09:09:01,915 INFO L226 Difference]: Without dead ends: 7377 [2019-11-20 09:09:01,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2019-11-20 09:09:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 7375. [2019-11-20 09:09:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-11-20 09:09:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 10504 transitions. [2019-11-20 09:09:02,287 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 10504 transitions. Word has length 105 [2019-11-20 09:09:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:02,287 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 10504 transitions. [2019-11-20 09:09:02,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:09:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 10504 transitions. [2019-11-20 09:09:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 09:09:02,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:02,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:02,294 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -717867767, now seen corresponding path program 1 times [2019-11-20 09:09:02,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:02,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278191573] [2019-11-20 09:09:02,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:02,397 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-20 09:09:02,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278191573] [2019-11-20 09:09:02,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:02,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:02,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497776539] [2019-11-20 09:09:02,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:02,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:02,400 INFO L87 Difference]: Start difference. First operand 7375 states and 10504 transitions. Second operand 4 states. [2019-11-20 09:09:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:02,687 INFO L93 Difference]: Finished difference Result 12986 states and 18662 transitions. [2019-11-20 09:09:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:02,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 09:09:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:02,698 INFO L225 Difference]: With dead ends: 12986 [2019-11-20 09:09:02,698 INFO L226 Difference]: Without dead ends: 6223 [2019-11-20 09:09:02,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2019-11-20 09:09:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6223. [2019-11-20 09:09:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2019-11-20 09:09:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 8885 transitions. [2019-11-20 09:09:03,178 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 8885 transitions. Word has length 105 [2019-11-20 09:09:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:03,178 INFO L462 AbstractCegarLoop]: Abstraction has 6223 states and 8885 transitions. [2019-11-20 09:09:03,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 8885 transitions. [2019-11-20 09:09:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 09:09:03,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:03,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:03,184 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1323620079, now seen corresponding path program 1 times [2019-11-20 09:09:03,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:03,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669489932] [2019-11-20 09:09:03,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:03,315 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-20 09:09:03,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669489932] [2019-11-20 09:09:03,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:03,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:03,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603082703] [2019-11-20 09:09:03,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:03,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:03,317 INFO L87 Difference]: Start difference. First operand 6223 states and 8885 transitions. Second operand 4 states. [2019-11-20 09:09:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:03,627 INFO L93 Difference]: Finished difference Result 9759 states and 14008 transitions. [2019-11-20 09:09:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:03,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 09:09:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:03,636 INFO L225 Difference]: With dead ends: 9759 [2019-11-20 09:09:03,637 INFO L226 Difference]: Without dead ends: 5619 [2019-11-20 09:09:03,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2019-11-20 09:09:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 5582. [2019-11-20 09:09:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2019-11-20 09:09:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 7926 transitions. [2019-11-20 09:09:03,910 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 7926 transitions. Word has length 107 [2019-11-20 09:09:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:03,911 INFO L462 AbstractCegarLoop]: Abstraction has 5582 states and 7926 transitions. [2019-11-20 09:09:03,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 7926 transitions. [2019-11-20 09:09:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 09:09:03,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:03,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:03,917 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1709812529, now seen corresponding path program 1 times [2019-11-20 09:09:03,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:03,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677688610] [2019-11-20 09:09:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:03,957 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-20 09:09:03,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677688610] [2019-11-20 09:09:03,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:09:03,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631539520] [2019-11-20 09:09:03,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:09:03,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:09:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:03,959 INFO L87 Difference]: Start difference. First operand 5582 states and 7926 transitions. Second operand 3 states. [2019-11-20 09:09:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:04,723 INFO L93 Difference]: Finished difference Result 14170 states and 20651 transitions. [2019-11-20 09:09:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:09:04,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-20 09:09:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:04,747 INFO L225 Difference]: With dead ends: 14170 [2019-11-20 09:09:04,748 INFO L226 Difference]: Without dead ends: 10298 [2019-11-20 09:09:04,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10298 states. [2019-11-20 09:09:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10298 to 10296. [2019-11-20 09:09:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10296 states. [2019-11-20 09:09:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10296 states to 10296 states and 14706 transitions. [2019-11-20 09:09:05,250 INFO L78 Accepts]: Start accepts. Automaton has 10296 states and 14706 transitions. Word has length 109 [2019-11-20 09:09:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:05,250 INFO L462 AbstractCegarLoop]: Abstraction has 10296 states and 14706 transitions. [2019-11-20 09:09:05,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:09:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10296 states and 14706 transitions. [2019-11-20 09:09:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 09:09:05,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:05,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:05,259 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1172299126, now seen corresponding path program 1 times [2019-11-20 09:09:05,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:05,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632140320] [2019-11-20 09:09:05,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:09:05,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632140320] [2019-11-20 09:09:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:05,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442756060] [2019-11-20 09:09:05,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:05,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:05,369 INFO L87 Difference]: Start difference. First operand 10296 states and 14706 transitions. Second operand 4 states. [2019-11-20 09:09:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:05,858 INFO L93 Difference]: Finished difference Result 20649 states and 29486 transitions. [2019-11-20 09:09:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:05,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-20 09:09:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:05,872 INFO L225 Difference]: With dead ends: 20649 [2019-11-20 09:09:05,872 INFO L226 Difference]: Without dead ends: 10502 [2019-11-20 09:09:05,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-11-20 09:09:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10408. [2019-11-20 09:09:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10408 states. [2019-11-20 09:09:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10408 states to 10408 states and 14827 transitions. [2019-11-20 09:09:06,621 INFO L78 Accepts]: Start accepts. Automaton has 10408 states and 14827 transitions. Word has length 109 [2019-11-20 09:09:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:06,621 INFO L462 AbstractCegarLoop]: Abstraction has 10408 states and 14827 transitions. [2019-11-20 09:09:06,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 10408 states and 14827 transitions. [2019-11-20 09:09:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 09:09:06,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:06,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:06,636 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash 808379514, now seen corresponding path program 1 times [2019-11-20 09:09:06,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:06,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091587548] [2019-11-20 09:09:06,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:09:06,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091587548] [2019-11-20 09:09:06,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:06,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:09:06,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428076169] [2019-11-20 09:09:06,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:09:06,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:09:06,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:06,671 INFO L87 Difference]: Start difference. First operand 10408 states and 14827 transitions. Second operand 3 states. [2019-11-20 09:09:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:07,689 INFO L93 Difference]: Finished difference Result 28055 states and 40150 transitions. [2019-11-20 09:09:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:09:07,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-20 09:09:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:07,711 INFO L225 Difference]: With dead ends: 28055 [2019-11-20 09:09:07,711 INFO L226 Difference]: Without dead ends: 20618 [2019-11-20 09:09:07,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20618 states. [2019-11-20 09:09:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20618 to 10418. [2019-11-20 09:09:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2019-11-20 09:09:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 14837 transitions. [2019-11-20 09:09:08,570 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 14837 transitions. Word has length 110 [2019-11-20 09:09:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:08,570 INFO L462 AbstractCegarLoop]: Abstraction has 10418 states and 14837 transitions. [2019-11-20 09:09:08,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:09:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 14837 transitions. [2019-11-20 09:09:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:08,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:08,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:08,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash 744989516, now seen corresponding path program 1 times [2019-11-20 09:09:08,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:08,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591369086] [2019-11-20 09:09:08,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:08,637 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-20 09:09:08,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591369086] [2019-11-20 09:09:08,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:08,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:09:08,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561672471] [2019-11-20 09:09:08,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:09:08,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:09:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:08,639 INFO L87 Difference]: Start difference. First operand 10418 states and 14837 transitions. Second operand 3 states. [2019-11-20 09:09:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:09,658 INFO L93 Difference]: Finished difference Result 22638 states and 34147 transitions. [2019-11-20 09:09:09,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:09:09,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-20 09:09:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:09,674 INFO L225 Difference]: With dead ends: 22638 [2019-11-20 09:09:09,674 INFO L226 Difference]: Without dead ends: 16528 [2019-11-20 09:09:09,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:09:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2019-11-20 09:09:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 16484. [2019-11-20 09:09:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16484 states. [2019-11-20 09:09:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16484 states to 16484 states and 24155 transitions. [2019-11-20 09:09:10,720 INFO L78 Accepts]: Start accepts. Automaton has 16484 states and 24155 transitions. Word has length 111 [2019-11-20 09:09:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:10,721 INFO L462 AbstractCegarLoop]: Abstraction has 16484 states and 24155 transitions. [2019-11-20 09:09:10,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:09:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16484 states and 24155 transitions. [2019-11-20 09:09:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:10,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:10,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:10,728 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1518514165, now seen corresponding path program 1 times [2019-11-20 09:09:10,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:10,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454967316] [2019-11-20 09:09:10,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:09:11,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454967316] [2019-11-20 09:09:11,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:11,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-20 09:09:11,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114742458] [2019-11-20 09:09:11,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 09:09:11,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 09:09:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-20 09:09:11,077 INFO L87 Difference]: Start difference. First operand 16484 states and 24155 transitions. Second operand 15 states. [2019-11-20 09:09:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:16,367 INFO L93 Difference]: Finished difference Result 66341 states and 101068 transitions. [2019-11-20 09:09:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 09:09:16,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2019-11-20 09:09:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:16,413 INFO L225 Difference]: With dead ends: 66341 [2019-11-20 09:09:16,414 INFO L226 Difference]: Without dead ends: 53512 [2019-11-20 09:09:16,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-11-20 09:09:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53512 states. [2019-11-20 09:09:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53512 to 53496. [2019-11-20 09:09:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53496 states. [2019-11-20 09:09:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53496 states to 53496 states and 80894 transitions. [2019-11-20 09:09:19,884 INFO L78 Accepts]: Start accepts. Automaton has 53496 states and 80894 transitions. Word has length 111 [2019-11-20 09:09:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:19,884 INFO L462 AbstractCegarLoop]: Abstraction has 53496 states and 80894 transitions. [2019-11-20 09:09:19,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 09:09:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 53496 states and 80894 transitions. [2019-11-20 09:09:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:19,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:19,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:19,894 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1157308592, now seen corresponding path program 1 times [2019-11-20 09:09:19,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:19,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342461999] [2019-11-20 09:09:19,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:20,116 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-20 09:09:20,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342461999] [2019-11-20 09:09:20,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:20,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-20 09:09:20,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814584904] [2019-11-20 09:09:20,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 09:09:20,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 09:09:20,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:09:20,118 INFO L87 Difference]: Start difference. First operand 53496 states and 80894 transitions. Second operand 12 states. [2019-11-20 09:09:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:25,690 INFO L93 Difference]: Finished difference Result 87634 states and 134104 transitions. [2019-11-20 09:09:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:09:25,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-11-20 09:09:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:25,756 INFO L225 Difference]: With dead ends: 87634 [2019-11-20 09:09:25,757 INFO L226 Difference]: Without dead ends: 58169 [2019-11-20 09:09:25,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:09:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58169 states. [2019-11-20 09:09:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58169 to 34849. [2019-11-20 09:09:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34849 states. [2019-11-20 09:09:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34849 states to 34849 states and 52560 transitions. [2019-11-20 09:09:28,573 INFO L78 Accepts]: Start accepts. Automaton has 34849 states and 52560 transitions. Word has length 111 [2019-11-20 09:09:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:28,573 INFO L462 AbstractCegarLoop]: Abstraction has 34849 states and 52560 transitions. [2019-11-20 09:09:28,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 09:09:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 34849 states and 52560 transitions. [2019-11-20 09:09:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:28,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:28,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:28,579 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1352743846, now seen corresponding path program 1 times [2019-11-20 09:09:28,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:28,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680515000] [2019-11-20 09:09:28,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:28,848 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-20 09:09:28,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680515000] [2019-11-20 09:09:28,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:28,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-20 09:09:28,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293965381] [2019-11-20 09:09:28,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 09:09:28,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:28,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 09:09:28,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:09:28,851 INFO L87 Difference]: Start difference. First operand 34849 states and 52560 transitions. Second operand 12 states. [2019-11-20 09:09:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:36,955 INFO L93 Difference]: Finished difference Result 106920 states and 163735 transitions. [2019-11-20 09:09:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:09:36,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-11-20 09:09:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:37,034 INFO L225 Difference]: With dead ends: 106920 [2019-11-20 09:09:37,034 INFO L226 Difference]: Without dead ends: 80331 [2019-11-20 09:09:37,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:09:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80331 states. [2019-11-20 09:09:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80331 to 35330. [2019-11-20 09:09:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-11-20 09:09:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 53109 transitions. [2019-11-20 09:09:40,219 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 53109 transitions. Word has length 111 [2019-11-20 09:09:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:40,219 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 53109 transitions. [2019-11-20 09:09:40,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 09:09:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 53109 transitions. [2019-11-20 09:09:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:40,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:40,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:40,226 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -266400693, now seen corresponding path program 1 times [2019-11-20 09:09:40,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:40,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650099374] [2019-11-20 09:09:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:40,371 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-20 09:09:40,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650099374] [2019-11-20 09:09:40,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:40,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 09:09:40,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717219832] [2019-11-20 09:09:40,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:09:40,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:09:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:09:40,373 INFO L87 Difference]: Start difference. First operand 35330 states and 53109 transitions. Second operand 8 states. [2019-11-20 09:09:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:43,703 INFO L93 Difference]: Finished difference Result 65942 states and 100697 transitions. [2019-11-20 09:09:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:43,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-11-20 09:09:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:43,738 INFO L225 Difference]: With dead ends: 65942 [2019-11-20 09:09:43,739 INFO L226 Difference]: Without dead ends: 35332 [2019-11-20 09:09:43,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-20 09:09:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35332 states. [2019-11-20 09:09:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35332 to 22620. [2019-11-20 09:09:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22620 states. [2019-11-20 09:09:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22620 states to 22620 states and 33449 transitions. [2019-11-20 09:09:47,444 INFO L78 Accepts]: Start accepts. Automaton has 22620 states and 33449 transitions. Word has length 111 [2019-11-20 09:09:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:47,444 INFO L462 AbstractCegarLoop]: Abstraction has 22620 states and 33449 transitions. [2019-11-20 09:09:47,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:09:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22620 states and 33449 transitions. [2019-11-20 09:09:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:47,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:47,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:47,450 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2048402849, now seen corresponding path program 1 times [2019-11-20 09:09:47,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:47,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511358169] [2019-11-20 09:09:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:47,547 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-20 09:09:47,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511358169] [2019-11-20 09:09:47,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:47,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:47,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739023166] [2019-11-20 09:09:47,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:47,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:47,549 INFO L87 Difference]: Start difference. First operand 22620 states and 33449 transitions. Second operand 4 states. [2019-11-20 09:09:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:49,666 INFO L93 Difference]: Finished difference Result 45407 states and 67107 transitions. [2019-11-20 09:09:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:49,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-20 09:09:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:49,686 INFO L225 Difference]: With dead ends: 45407 [2019-11-20 09:09:49,686 INFO L226 Difference]: Without dead ends: 23121 [2019-11-20 09:09:49,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23121 states. [2019-11-20 09:09:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23121 to 22901. [2019-11-20 09:09:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22901 states. [2019-11-20 09:09:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22901 states to 22901 states and 33750 transitions. [2019-11-20 09:09:51,872 INFO L78 Accepts]: Start accepts. Automaton has 22901 states and 33750 transitions. Word has length 111 [2019-11-20 09:09:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:51,873 INFO L462 AbstractCegarLoop]: Abstraction has 22901 states and 33750 transitions. [2019-11-20 09:09:51,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22901 states and 33750 transitions. [2019-11-20 09:09:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 09:09:51,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:51,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:51,879 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1191527915, now seen corresponding path program 1 times [2019-11-20 09:09:51,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:51,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729986593] [2019-11-20 09:09:51,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:09:51,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729986593] [2019-11-20 09:09:51,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:51,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:09:51,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38584294] [2019-11-20 09:09:51,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:09:51,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:09:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:09:51,970 INFO L87 Difference]: Start difference. First operand 22901 states and 33750 transitions. Second operand 4 states. [2019-11-20 09:09:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:09:53,803 INFO L93 Difference]: Finished difference Result 32520 states and 47979 transitions. [2019-11-20 09:09:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:09:53,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-20 09:09:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:09:53,819 INFO L225 Difference]: With dead ends: 32520 [2019-11-20 09:09:53,820 INFO L226 Difference]: Without dead ends: 19857 [2019-11-20 09:09:53,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:09:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19857 states. [2019-11-20 09:09:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19857 to 19857. [2019-11-20 09:09:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19857 states. [2019-11-20 09:09:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19857 states to 19857 states and 29199 transitions. [2019-11-20 09:09:55,816 INFO L78 Accepts]: Start accepts. Automaton has 19857 states and 29199 transitions. Word has length 111 [2019-11-20 09:09:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:09:55,816 INFO L462 AbstractCegarLoop]: Abstraction has 19857 states and 29199 transitions. [2019-11-20 09:09:55,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:09:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19857 states and 29199 transitions. [2019-11-20 09:09:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 09:09:55,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:09:55,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:09:55,819 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:09:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:09:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1910968843, now seen corresponding path program 1 times [2019-11-20 09:09:55,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:09:55,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684357239] [2019-11-20 09:09:55,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:09:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:09:56,791 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-20 09:09:56,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684357239] [2019-11-20 09:09:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:09:56,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-20 09:09:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189230001] [2019-11-20 09:09:56,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 09:09:56,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:09:56,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 09:09:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-20 09:09:56,793 INFO L87 Difference]: Start difference. First operand 19857 states and 29199 transitions. Second operand 23 states. [2019-11-20 09:09:57,594 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 09:09:57,784 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-20 09:09:58,114 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-20 09:09:58,325 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-11-20 09:09:58,974 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-20 09:10:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:10:06,620 INFO L93 Difference]: Finished difference Result 64360 states and 97302 transitions. [2019-11-20 09:10:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 09:10:06,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 113 [2019-11-20 09:10:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:10:06,707 INFO L225 Difference]: With dead ends: 64360 [2019-11-20 09:10:06,707 INFO L226 Difference]: Without dead ends: 57246 [2019-11-20 09:10:06,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 09:10:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57246 states. [2019-11-20 09:10:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57246 to 20420. [2019-11-20 09:10:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20420 states. [2019-11-20 09:10:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20420 states to 20420 states and 29896 transitions. [2019-11-20 09:10:09,375 INFO L78 Accepts]: Start accepts. Automaton has 20420 states and 29896 transitions. Word has length 113 [2019-11-20 09:10:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:10:09,375 INFO L462 AbstractCegarLoop]: Abstraction has 20420 states and 29896 transitions. [2019-11-20 09:10:09,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 09:10:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20420 states and 29896 transitions. [2019-11-20 09:10:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 09:10:09,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:10:09,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:10:09,379 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:10:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:10:09,379 INFO L82 PathProgramCache]: Analyzing trace with hash 655744324, now seen corresponding path program 1 times [2019-11-20 09:10:09,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:10:09,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072796767] [2019-11-20 09:10:09,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:10:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:10:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 09:10:09,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 09:10:09,529 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 09:10:09,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:10:09 BoogieIcfgContainer [2019-11-20 09:10:09,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:10:09,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:10:09,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:10:09,714 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:10:09,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:08:55" (3/4) ... [2019-11-20 09:10:09,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 09:10:09,872 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_886b7398-38b1-49b0-accb-1f7e463a0c2e/bin/uautomizer/witness.graphml [2019-11-20 09:10:09,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:10:09,874 INFO L168 Benchmark]: Toolchain (without parser) took 75825.07 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 940.7 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,874 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:10:09,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,875 INFO L168 Benchmark]: Boogie Preprocessor took 51.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:10:09,875 INFO L168 Benchmark]: RCFGBuilder took 1067.20 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: 97.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,876 INFO L168 Benchmark]: TraceAbstraction took 73819.98 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,876 INFO L168 Benchmark]: Witness Printer took 159.38 ms. Allocated memory is still 5.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:10:09,878 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1067.20 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: 97.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73819.98 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 159.38 ms. Allocated memory is still 5.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: 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] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; [L65] int __return_1142; [L66] int __return_1270; [L67] int __return_1389; [L68] int __return_1499; VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=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, 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] [L71] int main__c1; [L72] int main__i2; [L73] main__c1 = 0 [L74] ep12 = __VERIFIER_nondet_bool() [L75] ep13 = __VERIFIER_nondet_bool() [L76] ep21 = __VERIFIER_nondet_bool() [L77] ep23 = __VERIFIER_nondet_bool() [L78] ep31 = __VERIFIER_nondet_bool() [L79] ep32 = __VERIFIER_nondet_bool() [L80] id1 = __VERIFIER_nondet_char() [L81] r1 = __VERIFIER_nondet_uchar() [L82] st1 = __VERIFIER_nondet_char() [L83] nl1 = __VERIFIER_nondet_char() [L84] m1 = __VERIFIER_nondet_char() [L85] max1 = __VERIFIER_nondet_char() [L86] mode1 = __VERIFIER_nondet_bool() [L87] id2 = __VERIFIER_nondet_char() [L88] r2 = __VERIFIER_nondet_uchar() [L89] st2 = __VERIFIER_nondet_char() [L90] nl2 = __VERIFIER_nondet_char() [L91] m2 = __VERIFIER_nondet_char() [L92] max2 = __VERIFIER_nondet_char() [L93] mode2 = __VERIFIER_nondet_bool() [L94] id3 = __VERIFIER_nondet_char() [L95] r3 = __VERIFIER_nondet_uchar() [L96] st3 = __VERIFIER_nondet_char() [L97] nl3 = __VERIFIER_nondet_char() [L98] m3 = __VERIFIER_nondet_char() [L99] max3 = __VERIFIER_nondet_char() [L100] mode3 = __VERIFIER_nondet_bool() [L102] _Bool init__r121; [L103] _Bool init__r131; [L104] _Bool init__r211; [L105] _Bool init__r231; [L106] _Bool init__r311; [L107] _Bool init__r321; [L108] _Bool init__r122; [L109] int init__tmp; [L110] _Bool init__r132; [L111] int init__tmp___0; [L112] _Bool init__r212; [L113] int init__tmp___1; [L114] _Bool init__r232; [L115] int init__tmp___2; [L116] _Bool init__r312; [L117] int init__tmp___3; [L118] _Bool init__r322; [L119] int init__tmp___4; [L120] int init__tmp___5; [L121] init__r121 = ep12 [L122] init__r131 = ep13 [L123] init__r211 = ep21 [L124] init__r231 = ep23 [L125] init__r311 = ep31 [L126] init__r321 = ep32 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L127] COND TRUE !(init__r121 == 0) [L129] init__tmp = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L131] init__r122 = (_Bool)init__tmp VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(init__r131 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1612] COND TRUE !(init__r121 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1614] COND TRUE !(ep23 == 0) [L1616] init__tmp___0 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L136] init__r132 = (_Bool)init__tmp___0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] COND FALSE !(!(init__r211 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1589] COND TRUE !(init__r231 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1591] COND TRUE !(ep31 == 0) [L1593] init__tmp___1 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L141] init__r212 = (_Bool)init__tmp___1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] COND TRUE !(init__r231 == 0) [L144] init__tmp___2 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L146] init__r232 = (_Bool)init__tmp___2 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] COND TRUE !(init__r311 == 0) [L149] init__tmp___3 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L151] init__r312 = (_Bool)init__tmp___3 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] COND FALSE !(!(init__r321 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1520] COND TRUE !(init__r311 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L1522] COND TRUE !(ep12 == 0) [L1524] init__tmp___4 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L156] init__r322 = (_Bool)init__tmp___4 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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 TRUE ((int)id1) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L161] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id2) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id3) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)r1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)r2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)r3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE !(init__r122 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE !(init__r132 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE !(init__r212 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r232 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r312 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r322 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)st1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)st2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)st3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)nl1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)nl2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)nl3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)mode1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)mode2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)mode3) == 0 [L211] init__tmp___5 = 1 [L212] __return_1142 = init__tmp___5 [L213] main__i2 = __return_1142 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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 main__i2 != 0 [L216] p12_old = nomsg [L217] p12_new = nomsg [L218] p13_old = nomsg [L219] p13_new = nomsg [L220] p21_old = nomsg [L221] p21_new = nomsg [L222] p23_old = nomsg [L223] p23_new = nomsg [L224] p31_old = nomsg [L225] p31_new = nomsg [L226] p32_old = nomsg [L227] p32_new = nomsg [L228] main__i2 = 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND FALSE !(!(mode1 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L236] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L238] COND TRUE !(ep12 == 0) [L240] int node1____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE max1 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L243] COND TRUE p12_new == nomsg [L245] node1____CPAchecker_TMP_0 = max1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L247] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] [L249] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, 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] mode1 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L262] COND FALSE !(!(mode2 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L268] COND TRUE ((int)r2) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L270] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L281] COND TRUE !(ep23 == 0) [L283] int node2____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L284] COND TRUE max2 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, 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] [L286] COND TRUE p23_new == nomsg [L288] node2____CPAchecker_TMP_1 = max2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode2 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L294] COND FALSE !(!(mode3 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L300] COND TRUE ((int)r3) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE !(ep31 == 0) [L304] int node3____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE max3 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE p31_new == nomsg [L309] node3____CPAchecker_TMP_0 = max3 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L313] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L324] mode3 = 1 [L325] p12_old = p12_new [L326] p12_new = nomsg [L327] p13_old = p13_new [L328] p13_new = nomsg [L329] p21_old = p21_new [L330] p21_new = nomsg [L331] p23_old = p23_new [L332] p23_new = nomsg [L333] p31_old = p31_new [L334] p31_new = nomsg [L335] p32_old = p32_new [L336] p32_new = nomsg [L338] int check__tmp; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L339] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((int)r1) < 2 [L367] check__tmp = 1 [L368] __return_1270 = check__tmp [L369] main__c1 = __return_1270 [L371] _Bool __tmp_1; [L372] __tmp_1 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE !(mode1 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND FALSE !(r1 == 255) [L390] r1 = r1 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE !(ep31 == 0) [L401] m1 = p31_old [L402] p31_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((int)r1) == 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)max1) == ((int)id1) [L411] st1 = 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L413] mode1 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L415] COND TRUE !(mode2 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L417] COND FALSE !(r2 == 255) [L423] r2 = r2 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L424] COND TRUE !(ep12 == 0) [L426] m2 = p12_old [L427] p12_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L428] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L432] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L440] COND FALSE !(((int)r2) == 2) [L446] mode2 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L448] COND TRUE !(mode3 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L450] COND FALSE !(r3 == 255) [L456] r3 = r3 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L457] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L465] COND TRUE !(ep23 == 0) [L467] m3 = p23_old [L468] p23_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, 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] [L469] COND TRUE ((int)m3) > ((int)max3) [L471] max3 = m3 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=1, 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] [L473] COND FALSE !(((int)r3) == 2) [L479] mode3 = 0 [L480] p12_old = p12_new [L481] p12_new = nomsg [L482] p13_old = p13_new [L483] p13_new = nomsg [L484] p21_old = p21_new [L485] p21_new = nomsg [L486] p23_old = p23_new [L487] p23_new = nomsg [L488] p31_old = p31_new [L489] p31_new = nomsg [L490] p32_old = p32_new [L491] p32_new = nomsg [L493] int check__tmp; VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L494] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L496] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L498] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L500] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L502] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L508] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1090] check__tmp = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L526] __return_1389 = check__tmp [L527] main__c1 = __return_1389 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L530] _Bool __tmp_2; [L531] __tmp_2 = main__c1 [L532] _Bool assert__arg; [L533] assert__arg = __tmp_2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L534] COND TRUE assert__arg == 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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] [L536] __VERIFIER_error() VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, 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, 224 locations, 1 error locations. Result: UNSAFE, OverallTime: 73.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 43.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11114 SDtfs, 19271 SDslu, 22701 SDs, 0 SdLazy, 6882 SolverSat, 753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53496occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 133219 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2603 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...