./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc86cc3add356b600fcf92e092d72b9013e4f56a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-30 01:31:10,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:31:10,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:31:10,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:31:10,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:31:10,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:31:10,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:31:10,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:31:10,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:31:10,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:31:10,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:31:10,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:31:10,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:31:10,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:31:10,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:31:10,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:31:10,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:31:10,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:31:10,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:31:10,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:31:10,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:31:10,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:31:10,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:31:10,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:31:10,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:31:10,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:31:10,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:31:10,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:31:10,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:31:10,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:31:10,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:31:10,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:31:10,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:31:10,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:31:10,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:31:10,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:31:10,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:31:10,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:31:10,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:31:10,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:31:10,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:31:10,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:31:10,939 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:31:10,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:31:10,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:31:10,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:31:10,941 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:31:10,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:31:10,942 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:31:10,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:31:10,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:31:10,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:31:10,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:31:10,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:31:10,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:31:10,944 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:31:10,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:31:10,945 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:31:10,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:31:10,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:31:10,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:31:10,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:31:10,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:31:10,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:31:10,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:31:10,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:31:10,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:31:10,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:31:10,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:31:10,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:31:10,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:31:10,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_195aeff1-8d13-4b2d-a469-032a0d466468/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(reach_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 -> bc86cc3add356b600fcf92e092d72b9013e4f56a [2020-11-30 01:31:11,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:31:11,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:31:11,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:31:11,375 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:31:11,380 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:31:11,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 01:31:11,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/data/f992e52a9/06585c8fa52247339cacd769d7d36282/FLAG69c6235bf [2020-11-30 01:31:12,096 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:31:12,097 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 01:31:12,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/data/f992e52a9/06585c8fa52247339cacd769d7d36282/FLAG69c6235bf [2020-11-30 01:31:12,391 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/data/f992e52a9/06585c8fa52247339cacd769d7d36282 [2020-11-30 01:31:12,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:31:12,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:31:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:31:12,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:31:12,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:31:12,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:31:12" (1/1) ... [2020-11-30 01:31:12,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1773c2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:12, skipping insertion in model container [2020-11-30 01:31:12,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:31:12" (1/1) ... [2020-11-30 01:31:12,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:31:12,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:31:12,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:31:12,981 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:31:13,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:31:13,108 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:31:13,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13 WrapperNode [2020-11-30 01:31:13,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:31:13,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:31:13,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:31:13,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:31:13,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:31:13,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:31:13,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:31:13,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:31:13,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... [2020-11-30 01:31:13,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:31:13,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:31:13,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:31:13,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:31:13,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/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 [2020-11-30 01:31:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:31:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:31:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:31:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:31:15,024 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:31:15,024 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 01:31:15,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:15 BoogieIcfgContainer [2020-11-30 01:31:15,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:31:15,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:31:15,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:31:15,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:31:15,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:31:12" (1/3) ... [2020-11-30 01:31:15,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a064c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:31:15, skipping insertion in model container [2020-11-30 01:31:15,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:13" (2/3) ... [2020-11-30 01:31:15,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a064c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:31:15, skipping insertion in model container [2020-11-30 01:31:15,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:15" (3/3) ... [2020-11-30 01:31:15,038 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-11-30 01:31:15,051 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:31:15,055 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 01:31:15,065 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 01:31:15,119 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:31:15,119 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:31:15,119 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:31:15,119 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:31:15,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:31:15,120 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:31:15,120 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:31:15,120 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:31:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2020-11-30 01:31:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 01:31:15,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:15,166 INFO L422 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] [2020-11-30 01:31:15,168 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-11-30 01:31:15,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:15,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282895184] [2020-11-30 01:31:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:15,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282895184] [2020-11-30 01:31:15,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:15,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:31:15,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999463706] [2020-11-30 01:31:15,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 01:31:15,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:31:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:31:15,468 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 2 states. [2020-11-30 01:31:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:15,534 INFO L93 Difference]: Finished difference Result 591 states and 911 transitions. [2020-11-30 01:31:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:31:15,538 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-11-30 01:31:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:15,557 INFO L225 Difference]: With dead ends: 591 [2020-11-30 01:31:15,557 INFO L226 Difference]: Without dead ends: 290 [2020-11-30 01:31:15,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:31:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-30 01:31:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-30 01:31:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-30 01:31:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2020-11-30 01:31:15,636 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 33 [2020-11-30 01:31:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:15,637 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2020-11-30 01:31:15,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 01:31:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2020-11-30 01:31:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 01:31:15,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:15,640 INFO L422 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] [2020-11-30 01:31:15,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:31:15,646 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-11-30 01:31:15,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:15,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715568213] [2020-11-30 01:31:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:15,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715568213] [2020-11-30 01:31:15,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:15,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:15,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381167881] [2020-11-30 01:31:15,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:15,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:15,779 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand 4 states. [2020-11-30 01:31:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:15,913 INFO L93 Difference]: Finished difference Result 566 states and 822 transitions. [2020-11-30 01:31:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:31:15,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 01:31:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:15,917 INFO L225 Difference]: With dead ends: 566 [2020-11-30 01:31:15,918 INFO L226 Difference]: Without dead ends: 290 [2020-11-30 01:31:15,921 INFO L677 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 [2020-11-30 01:31:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-30 01:31:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-30 01:31:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-30 01:31:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2020-11-30 01:31:15,972 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 33 [2020-11-30 01:31:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:15,972 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2020-11-30 01:31:15,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2020-11-30 01:31:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 01:31:15,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:15,975 INFO L422 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] [2020-11-30 01:31:15,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:31:15,976 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-11-30 01:31:15,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:15,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749014692] [2020-11-30 01:31:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:16,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749014692] [2020-11-30 01:31:16,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:16,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:16,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877239833] [2020-11-30 01:31:16,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:16,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:16,220 INFO L87 Difference]: Start difference. First operand 290 states and 412 transitions. Second operand 3 states. [2020-11-30 01:31:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:16,311 INFO L93 Difference]: Finished difference Result 596 states and 856 transitions. [2020-11-30 01:31:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:16,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-30 01:31:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:16,316 INFO L225 Difference]: With dead ends: 596 [2020-11-30 01:31:16,317 INFO L226 Difference]: Without dead ends: 323 [2020-11-30 01:31:16,319 INFO L677 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 [2020-11-30 01:31:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-11-30 01:31:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 266. [2020-11-30 01:31:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-11-30 01:31:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2020-11-30 01:31:16,352 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 44 [2020-11-30 01:31:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:16,353 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2020-11-30 01:31:16,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2020-11-30 01:31:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 01:31:16,356 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:16,356 INFO L422 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] [2020-11-30 01:31:16,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:31:16,357 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-11-30 01:31:16,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:16,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738309586] [2020-11-30 01:31:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:16,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738309586] [2020-11-30 01:31:16,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:16,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:16,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787436470] [2020-11-30 01:31:16,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:16,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:16,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:16,572 INFO L87 Difference]: Start difference. First operand 266 states and 376 transitions. Second operand 3 states. [2020-11-30 01:31:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:16,644 INFO L93 Difference]: Finished difference Result 741 states and 1059 transitions. [2020-11-30 01:31:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:16,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-11-30 01:31:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:16,650 INFO L225 Difference]: With dead ends: 741 [2020-11-30 01:31:16,650 INFO L226 Difference]: Without dead ends: 492 [2020-11-30 01:31:16,653 INFO L677 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 [2020-11-30 01:31:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-11-30 01:31:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 299. [2020-11-30 01:31:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-11-30 01:31:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 424 transitions. [2020-11-30 01:31:16,695 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 424 transitions. Word has length 53 [2020-11-30 01:31:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:16,696 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 424 transitions. [2020-11-30 01:31:16,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 424 transitions. [2020-11-30 01:31:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 01:31:16,699 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:16,699 INFO L422 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] [2020-11-30 01:31:16,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:31:16,700 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1464669016, now seen corresponding path program 1 times [2020-11-30 01:31:16,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:16,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142995218] [2020-11-30 01:31:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:16,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142995218] [2020-11-30 01:31:16,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:16,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:16,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299484062] [2020-11-30 01:31:16,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:16,893 INFO L87 Difference]: Start difference. First operand 299 states and 424 transitions. Second operand 3 states. [2020-11-30 01:31:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:16,970 INFO L93 Difference]: Finished difference Result 819 states and 1172 transitions. [2020-11-30 01:31:16,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-30 01:31:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:16,975 INFO L225 Difference]: With dead ends: 819 [2020-11-30 01:31:16,976 INFO L226 Difference]: Without dead ends: 537 [2020-11-30 01:31:16,977 INFO L677 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 [2020-11-30 01:31:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-30 01:31:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 320. [2020-11-30 01:31:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-11-30 01:31:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 454 transitions. [2020-11-30 01:31:17,007 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 454 transitions. Word has length 54 [2020-11-30 01:31:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:17,010 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 454 transitions. [2020-11-30 01:31:17,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 454 transitions. [2020-11-30 01:31:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 01:31:17,023 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:17,023 INFO L422 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] [2020-11-30 01:31:17,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:31:17,024 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash -784610646, now seen corresponding path program 1 times [2020-11-30 01:31:17,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:17,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939565150] [2020-11-30 01:31:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:17,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939565150] [2020-11-30 01:31:17,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:17,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:17,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176456041] [2020-11-30 01:31:17,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:17,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:17,214 INFO L87 Difference]: Start difference. First operand 320 states and 454 transitions. Second operand 5 states. [2020-11-30 01:31:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:17,556 INFO L93 Difference]: Finished difference Result 1000 states and 1433 transitions. [2020-11-30 01:31:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:31:17,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-11-30 01:31:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:17,566 INFO L225 Difference]: With dead ends: 1000 [2020-11-30 01:31:17,566 INFO L226 Difference]: Without dead ends: 697 [2020-11-30 01:31:17,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:31:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-11-30 01:31:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 418. [2020-11-30 01:31:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:31:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 591 transitions. [2020-11-30 01:31:17,601 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 591 transitions. Word has length 54 [2020-11-30 01:31:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:17,607 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 591 transitions. [2020-11-30 01:31:17,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:31:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 591 transitions. [2020-11-30 01:31:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-30 01:31:17,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:17,608 INFO L422 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] [2020-11-30 01:31:17,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:31:17,609 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:17,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1195121816, now seen corresponding path program 1 times [2020-11-30 01:31:17,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:17,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381493773] [2020-11-30 01:31:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:17,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381493773] [2020-11-30 01:31:17,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:17,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:17,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923121995] [2020-11-30 01:31:17,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:17,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:17,751 INFO L87 Difference]: Start difference. First operand 418 states and 591 transitions. Second operand 5 states. [2020-11-30 01:31:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:18,144 INFO L93 Difference]: Finished difference Result 1000 states and 1425 transitions. [2020-11-30 01:31:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:31:18,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-11-30 01:31:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:18,151 INFO L225 Difference]: With dead ends: 1000 [2020-11-30 01:31:18,151 INFO L226 Difference]: Without dead ends: 697 [2020-11-30 01:31:18,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:31:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-11-30 01:31:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 418. [2020-11-30 01:31:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:31:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2020-11-30 01:31:18,185 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 55 [2020-11-30 01:31:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:18,186 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2020-11-30 01:31:18,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:31:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2020-11-30 01:31:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 01:31:18,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:18,188 INFO L422 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] [2020-11-30 01:31:18,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:31:18,189 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-11-30 01:31:18,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:18,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080965938] [2020-11-30 01:31:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:18,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080965938] [2020-11-30 01:31:18,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:18,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:18,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206775316] [2020-11-30 01:31:18,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:18,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:18,328 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand 3 states. [2020-11-30 01:31:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:18,383 INFO L93 Difference]: Finished difference Result 840 states and 1196 transitions. [2020-11-30 01:31:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:18,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 01:31:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:18,389 INFO L225 Difference]: With dead ends: 840 [2020-11-30 01:31:18,389 INFO L226 Difference]: Without dead ends: 537 [2020-11-30 01:31:18,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-30 01:31:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 413. [2020-11-30 01:31:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-11-30 01:31:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 579 transitions. [2020-11-30 01:31:18,422 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 579 transitions. Word has length 56 [2020-11-30 01:31:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:18,424 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 579 transitions. [2020-11-30 01:31:18,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 579 transitions. [2020-11-30 01:31:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 01:31:18,425 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:18,426 INFO L422 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] [2020-11-30 01:31:18,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:31:18,426 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash 819502993, now seen corresponding path program 1 times [2020-11-30 01:31:18,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:18,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25294587] [2020-11-30 01:31:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:18,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25294587] [2020-11-30 01:31:18,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:18,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:18,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860069817] [2020-11-30 01:31:18,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:18,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:18,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:18,570 INFO L87 Difference]: Start difference. First operand 413 states and 579 transitions. Second operand 3 states. [2020-11-30 01:31:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:18,693 INFO L93 Difference]: Finished difference Result 839 states and 1195 transitions. [2020-11-30 01:31:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:18,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 01:31:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:18,699 INFO L225 Difference]: With dead ends: 839 [2020-11-30 01:31:18,699 INFO L226 Difference]: Without dead ends: 541 [2020-11-30 01:31:18,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-11-30 01:31:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 393. [2020-11-30 01:31:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-11-30 01:31:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 547 transitions. [2020-11-30 01:31:18,726 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 547 transitions. Word has length 60 [2020-11-30 01:31:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:18,726 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 547 transitions. [2020-11-30 01:31:18,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 547 transitions. [2020-11-30 01:31:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-30 01:31:18,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:18,728 INFO L422 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] [2020-11-30 01:31:18,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:31:18,728 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash -69192917, now seen corresponding path program 1 times [2020-11-30 01:31:18,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:18,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505359180] [2020-11-30 01:31:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:18,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505359180] [2020-11-30 01:31:18,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:18,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:18,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237194899] [2020-11-30 01:31:18,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:18,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:18,812 INFO L87 Difference]: Start difference. First operand 393 states and 547 transitions. Second operand 3 states. [2020-11-30 01:31:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:18,914 INFO L93 Difference]: Finished difference Result 807 states and 1139 transitions. [2020-11-30 01:31:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:18,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-30 01:31:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:18,921 INFO L225 Difference]: With dead ends: 807 [2020-11-30 01:31:18,921 INFO L226 Difference]: Without dead ends: 529 [2020-11-30 01:31:18,922 INFO L677 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 [2020-11-30 01:31:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-11-30 01:31:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-11-30 01:31:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-11-30 01:31:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 529 transitions. [2020-11-30 01:31:18,953 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 529 transitions. Word has length 64 [2020-11-30 01:31:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:18,953 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 529 transitions. [2020-11-30 01:31:18,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 529 transitions. [2020-11-30 01:31:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 01:31:18,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:18,955 INFO L422 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] [2020-11-30 01:31:18,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:31:18,955 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1588224041, now seen corresponding path program 1 times [2020-11-30 01:31:18,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:18,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118412569] [2020-11-30 01:31:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:19,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118412569] [2020-11-30 01:31:19,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:19,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:19,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997842761] [2020-11-30 01:31:19,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:19,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:19,080 INFO L87 Difference]: Start difference. First operand 381 states and 529 transitions. Second operand 6 states. [2020-11-30 01:31:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:19,339 INFO L93 Difference]: Finished difference Result 1405 states and 1974 transitions. [2020-11-30 01:31:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:31:19,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-11-30 01:31:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:19,348 INFO L225 Difference]: With dead ends: 1405 [2020-11-30 01:31:19,349 INFO L226 Difference]: Without dead ends: 1139 [2020-11-30 01:31:19,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:31:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2020-11-30 01:31:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 402. [2020-11-30 01:31:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-11-30 01:31:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 553 transitions. [2020-11-30 01:31:19,391 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 553 transitions. Word has length 65 [2020-11-30 01:31:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:19,392 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 553 transitions. [2020-11-30 01:31:19,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 553 transitions. [2020-11-30 01:31:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-30 01:31:19,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:19,400 INFO L422 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] [2020-11-30 01:31:19,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:31:19,402 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1255523790, now seen corresponding path program 1 times [2020-11-30 01:31:19,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:19,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496279123] [2020-11-30 01:31:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:19,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496279123] [2020-11-30 01:31:19,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:19,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:19,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781253711] [2020-11-30 01:31:19,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:19,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:19,492 INFO L87 Difference]: Start difference. First operand 402 states and 553 transitions. Second operand 3 states. [2020-11-30 01:31:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:19,655 INFO L93 Difference]: Finished difference Result 824 states and 1155 transitions. [2020-11-30 01:31:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:19,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-11-30 01:31:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:19,660 INFO L225 Difference]: With dead ends: 824 [2020-11-30 01:31:19,660 INFO L226 Difference]: Without dead ends: 558 [2020-11-30 01:31:19,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-11-30 01:31:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2020-11-30 01:31:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-30 01:31:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 521 transitions. [2020-11-30 01:31:19,704 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 521 transitions. Word has length 67 [2020-11-30 01:31:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:19,705 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 521 transitions. [2020-11-30 01:31:19,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 521 transitions. [2020-11-30 01:31:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-30 01:31:19,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:19,707 INFO L422 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] [2020-11-30 01:31:19,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:31:19,707 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -363592984, now seen corresponding path program 1 times [2020-11-30 01:31:19,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:19,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514889215] [2020-11-30 01:31:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:19,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514889215] [2020-11-30 01:31:19,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:19,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:19,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885413872] [2020-11-30 01:31:19,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:19,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:19,800 INFO L87 Difference]: Start difference. First operand 382 states and 521 transitions. Second operand 3 states. [2020-11-30 01:31:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:19,919 INFO L93 Difference]: Finished difference Result 792 states and 1099 transitions. [2020-11-30 01:31:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:19,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-11-30 01:31:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:19,923 INFO L225 Difference]: With dead ends: 792 [2020-11-30 01:31:19,924 INFO L226 Difference]: Without dead ends: 546 [2020-11-30 01:31:19,925 INFO L677 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 [2020-11-30 01:31:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-11-30 01:31:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 370. [2020-11-30 01:31:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-11-30 01:31:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 503 transitions. [2020-11-30 01:31:19,959 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 503 transitions. Word has length 71 [2020-11-30 01:31:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:19,960 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 503 transitions. [2020-11-30 01:31:19,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2020-11-30 01:31:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 01:31:19,961 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:19,961 INFO L422 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] [2020-11-30 01:31:19,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:31:19,962 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:19,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2014081046, now seen corresponding path program 1 times [2020-11-30 01:31:19,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:19,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897632870] [2020-11-30 01:31:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:20,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897632870] [2020-11-30 01:31:20,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:20,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:20,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300962189] [2020-11-30 01:31:20,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:20,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:20,254 INFO L87 Difference]: Start difference. First operand 370 states and 503 transitions. Second operand 6 states. [2020-11-30 01:31:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:20,617 INFO L93 Difference]: Finished difference Result 1057 states and 1464 transitions. [2020-11-30 01:31:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:31:20,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-30 01:31:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:20,624 INFO L225 Difference]: With dead ends: 1057 [2020-11-30 01:31:20,624 INFO L226 Difference]: Without dead ends: 823 [2020-11-30 01:31:20,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:31:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-11-30 01:31:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 395. [2020-11-30 01:31:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-11-30 01:31:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 538 transitions. [2020-11-30 01:31:20,671 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 538 transitions. Word has length 74 [2020-11-30 01:31:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:20,671 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 538 transitions. [2020-11-30 01:31:20,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 538 transitions. [2020-11-30 01:31:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 01:31:20,673 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:20,673 INFO L422 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] [2020-11-30 01:31:20,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:31:20,674 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1105027455, now seen corresponding path program 1 times [2020-11-30 01:31:20,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:20,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120005439] [2020-11-30 01:31:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:20,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120005439] [2020-11-30 01:31:20,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:20,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:20,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017547848] [2020-11-30 01:31:20,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:20,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:20,879 INFO L87 Difference]: Start difference. First operand 395 states and 538 transitions. Second operand 6 states. [2020-11-30 01:31:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:21,427 INFO L93 Difference]: Finished difference Result 1377 states and 1896 transitions. [2020-11-30 01:31:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:31:21,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-30 01:31:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:21,436 INFO L225 Difference]: With dead ends: 1377 [2020-11-30 01:31:21,436 INFO L226 Difference]: Without dead ends: 1125 [2020-11-30 01:31:21,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:31:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-11-30 01:31:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 423. [2020-11-30 01:31:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-11-30 01:31:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 569 transitions. [2020-11-30 01:31:21,492 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 569 transitions. Word has length 74 [2020-11-30 01:31:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:21,493 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 569 transitions. [2020-11-30 01:31:21,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 569 transitions. [2020-11-30 01:31:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 01:31:21,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:21,495 INFO L422 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] [2020-11-30 01:31:21,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:31:21,495 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-11-30 01:31:21,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:21,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110430115] [2020-11-30 01:31:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:21,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110430115] [2020-11-30 01:31:21,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:21,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:21,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386617687] [2020-11-30 01:31:21,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:21,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:21,581 INFO L87 Difference]: Start difference. First operand 423 states and 569 transitions. Second operand 4 states. [2020-11-30 01:31:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:21,852 INFO L93 Difference]: Finished difference Result 1095 states and 1487 transitions. [2020-11-30 01:31:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:21,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-30 01:31:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:21,859 INFO L225 Difference]: With dead ends: 1095 [2020-11-30 01:31:21,859 INFO L226 Difference]: Without dead ends: 837 [2020-11-30 01:31:21,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-11-30 01:31:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 636. [2020-11-30 01:31:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-30 01:31:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 845 transitions. [2020-11-30 01:31:21,940 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 845 transitions. Word has length 74 [2020-11-30 01:31:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:21,940 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 845 transitions. [2020-11-30 01:31:21,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 845 transitions. [2020-11-30 01:31:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 01:31:21,942 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:21,942 INFO L422 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] [2020-11-30 01:31:21,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:31:21,944 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1739304111, now seen corresponding path program 1 times [2020-11-30 01:31:21,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:21,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595344959] [2020-11-30 01:31:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:22,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595344959] [2020-11-30 01:31:22,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:22,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:22,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638425165] [2020-11-30 01:31:22,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:22,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:22,047 INFO L87 Difference]: Start difference. First operand 636 states and 845 transitions. Second operand 3 states. [2020-11-30 01:31:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:22,173 INFO L93 Difference]: Finished difference Result 1115 states and 1511 transitions. [2020-11-30 01:31:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:22,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-11-30 01:31:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:22,179 INFO L225 Difference]: With dead ends: 1115 [2020-11-30 01:31:22,179 INFO L226 Difference]: Without dead ends: 746 [2020-11-30 01:31:22,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-11-30 01:31:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 632. [2020-11-30 01:31:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2020-11-30 01:31:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 838 transitions. [2020-11-30 01:31:22,272 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 838 transitions. Word has length 75 [2020-11-30 01:31:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:22,273 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 838 transitions. [2020-11-30 01:31:22,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 838 transitions. [2020-11-30 01:31:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-30 01:31:22,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:22,275 INFO L422 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] [2020-11-30 01:31:22,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:31:22,276 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:22,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash -450501806, now seen corresponding path program 1 times [2020-11-30 01:31:22,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:22,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114642941] [2020-11-30 01:31:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:22,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114642941] [2020-11-30 01:31:22,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:22,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:22,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289220878] [2020-11-30 01:31:22,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:22,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:22,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:22,388 INFO L87 Difference]: Start difference. First operand 632 states and 838 transitions. Second operand 4 states. [2020-11-30 01:31:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:22,674 INFO L93 Difference]: Finished difference Result 1421 states and 1903 transitions. [2020-11-30 01:31:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:22,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-30 01:31:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:22,683 INFO L225 Difference]: With dead ends: 1421 [2020-11-30 01:31:22,683 INFO L226 Difference]: Without dead ends: 1042 [2020-11-30 01:31:22,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2020-11-30 01:31:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 843. [2020-11-30 01:31:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-11-30 01:31:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1108 transitions. [2020-11-30 01:31:22,786 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1108 transitions. Word has length 76 [2020-11-30 01:31:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:22,787 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1108 transitions. [2020-11-30 01:31:22,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1108 transitions. [2020-11-30 01:31:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-30 01:31:22,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:22,789 INFO L422 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] [2020-11-30 01:31:22,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:31:22,790 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1063318036, now seen corresponding path program 1 times [2020-11-30 01:31:22,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:22,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233598038] [2020-11-30 01:31:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:22,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233598038] [2020-11-30 01:31:22,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:22,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:22,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676706317] [2020-11-30 01:31:22,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:22,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:22,999 INFO L87 Difference]: Start difference. First operand 843 states and 1108 transitions. Second operand 6 states. [2020-11-30 01:31:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:23,791 INFO L93 Difference]: Finished difference Result 3156 states and 4193 transitions. [2020-11-30 01:31:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:31:23,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-11-30 01:31:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:23,809 INFO L225 Difference]: With dead ends: 3156 [2020-11-30 01:31:23,809 INFO L226 Difference]: Without dead ends: 2650 [2020-11-30 01:31:23,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:31:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-30 01:31:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 969. [2020-11-30 01:31:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-11-30 01:31:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1255 transitions. [2020-11-30 01:31:23,942 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1255 transitions. Word has length 76 [2020-11-30 01:31:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:23,943 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1255 transitions. [2020-11-30 01:31:23,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1255 transitions. [2020-11-30 01:31:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 01:31:23,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:23,945 INFO L422 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] [2020-11-30 01:31:23,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:31:23,946 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-11-30 01:31:23,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:23,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215090155] [2020-11-30 01:31:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:24,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215090155] [2020-11-30 01:31:24,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:24,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:24,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731224553] [2020-11-30 01:31:24,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:24,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:24,014 INFO L87 Difference]: Start difference. First operand 969 states and 1255 transitions. Second operand 4 states. [2020-11-30 01:31:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:24,366 INFO L93 Difference]: Finished difference Result 2341 states and 3074 transitions. [2020-11-30 01:31:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:24,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-30 01:31:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:24,379 INFO L225 Difference]: With dead ends: 2341 [2020-11-30 01:31:24,379 INFO L226 Difference]: Without dead ends: 1787 [2020-11-30 01:31:24,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2020-11-30 01:31:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1310. [2020-11-30 01:31:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2020-11-30 01:31:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1690 transitions. [2020-11-30 01:31:24,533 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1690 transitions. Word has length 77 [2020-11-30 01:31:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:24,534 INFO L481 AbstractCegarLoop]: Abstraction has 1310 states and 1690 transitions. [2020-11-30 01:31:24,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1690 transitions. [2020-11-30 01:31:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-30 01:31:24,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:24,537 INFO L422 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] [2020-11-30 01:31:24,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:31:24,537 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash 236706532, now seen corresponding path program 1 times [2020-11-30 01:31:24,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:24,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450664998] [2020-11-30 01:31:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:24,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450664998] [2020-11-30 01:31:24,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:24,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:24,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511252075] [2020-11-30 01:31:24,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:24,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:24,586 INFO L87 Difference]: Start difference. First operand 1310 states and 1690 transitions. Second operand 3 states. [2020-11-30 01:31:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:25,054 INFO L93 Difference]: Finished difference Result 3102 states and 4019 transitions. [2020-11-30 01:31:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:25,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-11-30 01:31:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:25,069 INFO L225 Difference]: With dead ends: 3102 [2020-11-30 01:31:25,070 INFO L226 Difference]: Without dead ends: 2154 [2020-11-30 01:31:25,072 INFO L677 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 [2020-11-30 01:31:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-11-30 01:31:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1312. [2020-11-30 01:31:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2020-11-30 01:31:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1692 transitions. [2020-11-30 01:31:25,228 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1692 transitions. Word has length 78 [2020-11-30 01:31:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:25,228 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1692 transitions. [2020-11-30 01:31:25,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1692 transitions. [2020-11-30 01:31:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 01:31:25,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:25,231 INFO L422 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] [2020-11-30 01:31:25,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:31:25,231 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:25,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1666890696, now seen corresponding path program 1 times [2020-11-30 01:31:25,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:25,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946215883] [2020-11-30 01:31:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:25,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946215883] [2020-11-30 01:31:25,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:25,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:25,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714813105] [2020-11-30 01:31:25,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:25,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:25,371 INFO L87 Difference]: Start difference. First operand 1312 states and 1692 transitions. Second operand 6 states. [2020-11-30 01:31:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:25,796 INFO L93 Difference]: Finished difference Result 2075 states and 2710 transitions. [2020-11-30 01:31:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:31:25,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-30 01:31:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:25,813 INFO L225 Difference]: With dead ends: 2075 [2020-11-30 01:31:25,813 INFO L226 Difference]: Without dead ends: 2073 [2020-11-30 01:31:25,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:31:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2020-11-30 01:31:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1314. [2020-11-30 01:31:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-11-30 01:31:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1694 transitions. [2020-11-30 01:31:25,980 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1694 transitions. Word has length 79 [2020-11-30 01:31:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:25,980 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1694 transitions. [2020-11-30 01:31:25,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1694 transitions. [2020-11-30 01:31:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 01:31:25,983 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:25,983 INFO L422 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] [2020-11-30 01:31:25,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:31:25,984 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash -275805135, now seen corresponding path program 1 times [2020-11-30 01:31:25,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:25,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596390310] [2020-11-30 01:31:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:26,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596390310] [2020-11-30 01:31:26,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:26,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:26,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635089923] [2020-11-30 01:31:26,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:26,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:26,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:26,185 INFO L87 Difference]: Start difference. First operand 1314 states and 1694 transitions. Second operand 6 states. [2020-11-30 01:31:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:26,749 INFO L93 Difference]: Finished difference Result 3110 states and 4116 transitions. [2020-11-30 01:31:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:31:26,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-30 01:31:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:26,765 INFO L225 Difference]: With dead ends: 3110 [2020-11-30 01:31:26,765 INFO L226 Difference]: Without dead ends: 2316 [2020-11-30 01:31:26,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:31:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2020-11-30 01:31:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1314. [2020-11-30 01:31:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-11-30 01:31:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1682 transitions. [2020-11-30 01:31:26,951 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1682 transitions. Word has length 79 [2020-11-30 01:31:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:26,951 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1682 transitions. [2020-11-30 01:31:26,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1682 transitions. [2020-11-30 01:31:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 01:31:26,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:26,954 INFO L422 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] [2020-11-30 01:31:26,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:31:26,962 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:26,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1725608005, now seen corresponding path program 1 times [2020-11-30 01:31:26,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:26,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316228556] [2020-11-30 01:31:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:27,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316228556] [2020-11-30 01:31:27,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:27,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:27,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236152298] [2020-11-30 01:31:27,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:27,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:27,085 INFO L87 Difference]: Start difference. First operand 1314 states and 1682 transitions. Second operand 4 states. [2020-11-30 01:31:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:27,318 INFO L93 Difference]: Finished difference Result 2624 states and 3383 transitions. [2020-11-30 01:31:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:27,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-11-30 01:31:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:27,327 INFO L225 Difference]: With dead ends: 2624 [2020-11-30 01:31:27,328 INFO L226 Difference]: Without dead ends: 1382 [2020-11-30 01:31:27,330 INFO L677 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 [2020-11-30 01:31:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-11-30 01:31:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1026. [2020-11-30 01:31:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-11-30 01:31:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1326 transitions. [2020-11-30 01:31:27,494 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1326 transitions. Word has length 79 [2020-11-30 01:31:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:27,494 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1326 transitions. [2020-11-30 01:31:27,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1326 transitions. [2020-11-30 01:31:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 01:31:27,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:27,497 INFO L422 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] [2020-11-30 01:31:27,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:31:27,497 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-11-30 01:31:27,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:27,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413414630] [2020-11-30 01:31:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:27,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413414630] [2020-11-30 01:31:27,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:27,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:27,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738009873] [2020-11-30 01:31:27,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:31:27,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:27,555 INFO L87 Difference]: Start difference. First operand 1026 states and 1326 transitions. Second operand 3 states. [2020-11-30 01:31:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:27,948 INFO L93 Difference]: Finished difference Result 2430 states and 3160 transitions. [2020-11-30 01:31:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:27,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-11-30 01:31:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:27,973 INFO L225 Difference]: With dead ends: 2430 [2020-11-30 01:31:27,973 INFO L226 Difference]: Without dead ends: 1548 [2020-11-30 01:31:27,975 INFO L677 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 [2020-11-30 01:31:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2020-11-30 01:31:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1032. [2020-11-30 01:31:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2020-11-30 01:31:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1332 transitions. [2020-11-30 01:31:28,124 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1332 transitions. Word has length 80 [2020-11-30 01:31:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:28,125 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1332 transitions. [2020-11-30 01:31:28,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:31:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1332 transitions. [2020-11-30 01:31:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 01:31:28,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:28,127 INFO L422 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] [2020-11-30 01:31:28,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 01:31:28,127 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1203231905, now seen corresponding path program 1 times [2020-11-30 01:31:28,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:28,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193266075] [2020-11-30 01:31:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:28,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193266075] [2020-11-30 01:31:28,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:28,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:28,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169165080] [2020-11-30 01:31:28,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:28,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:28,233 INFO L87 Difference]: Start difference. First operand 1032 states and 1332 transitions. Second operand 4 states. [2020-11-30 01:31:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:28,517 INFO L93 Difference]: Finished difference Result 2378 states and 3084 transitions. [2020-11-30 01:31:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:28,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-11-30 01:31:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:28,529 INFO L225 Difference]: With dead ends: 2378 [2020-11-30 01:31:28,537 INFO L226 Difference]: Without dead ends: 1442 [2020-11-30 01:31:28,539 INFO L677 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 [2020-11-30 01:31:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-11-30 01:31:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 974. [2020-11-30 01:31:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-11-30 01:31:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1252 transitions. [2020-11-30 01:31:28,686 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1252 transitions. Word has length 80 [2020-11-30 01:31:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:28,686 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 1252 transitions. [2020-11-30 01:31:28,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1252 transitions. [2020-11-30 01:31:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-30 01:31:28,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:28,688 INFO L422 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] [2020-11-30 01:31:28,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 01:31:28,689 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -868242773, now seen corresponding path program 1 times [2020-11-30 01:31:28,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:28,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529281309] [2020-11-30 01:31:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:28,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529281309] [2020-11-30 01:31:28,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:28,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:28,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601686824] [2020-11-30 01:31:28,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:28,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:28,868 INFO L87 Difference]: Start difference. First operand 974 states and 1252 transitions. Second operand 6 states. [2020-11-30 01:31:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:29,560 INFO L93 Difference]: Finished difference Result 3193 states and 4270 transitions. [2020-11-30 01:31:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:31:29,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-11-30 01:31:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:29,572 INFO L225 Difference]: With dead ends: 3193 [2020-11-30 01:31:29,573 INFO L226 Difference]: Without dead ends: 2410 [2020-11-30 01:31:29,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:31:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-11-30 01:31:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 962. [2020-11-30 01:31:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2020-11-30 01:31:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1240 transitions. [2020-11-30 01:31:29,744 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1240 transitions. Word has length 82 [2020-11-30 01:31:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:29,744 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1240 transitions. [2020-11-30 01:31:29,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1240 transitions. [2020-11-30 01:31:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 01:31:29,746 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:29,746 INFO L422 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] [2020-11-30 01:31:29,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 01:31:29,747 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 528163420, now seen corresponding path program 1 times [2020-11-30 01:31:29,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:29,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23937650] [2020-11-30 01:31:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:29,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23937650] [2020-11-30 01:31:29,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:29,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:29,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89768741] [2020-11-30 01:31:29,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:29,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:29,856 INFO L87 Difference]: Start difference. First operand 962 states and 1240 transitions. Second operand 6 states. [2020-11-30 01:31:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:30,267 INFO L93 Difference]: Finished difference Result 2284 states and 3064 transitions. [2020-11-30 01:31:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:31:30,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-11-30 01:31:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:30,272 INFO L225 Difference]: With dead ends: 2284 [2020-11-30 01:31:30,272 INFO L226 Difference]: Without dead ends: 1501 [2020-11-30 01:31:30,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:31:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2020-11-30 01:31:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 968. [2020-11-30 01:31:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-11-30 01:31:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1246 transitions. [2020-11-30 01:31:30,431 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1246 transitions. Word has length 83 [2020-11-30 01:31:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:30,432 INFO L481 AbstractCegarLoop]: Abstraction has 968 states and 1246 transitions. [2020-11-30 01:31:30,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1246 transitions. [2020-11-30 01:31:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:31:30,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:30,436 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:30,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:31:30,436 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash -283747983, now seen corresponding path program 1 times [2020-11-30 01:31:30,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:30,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70342447] [2020-11-30 01:31:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:30,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70342447] [2020-11-30 01:31:30,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611836035] [2020-11-30 01:31:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:31,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:31:31,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:31,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:31:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:33,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:33,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-30 01:31:33,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652120762] [2020-11-30 01:31:33,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:31:33,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:31:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:31:33,299 INFO L87 Difference]: Start difference. First operand 968 states and 1246 transitions. Second operand 12 states. [2020-11-30 01:31:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:35,987 INFO L93 Difference]: Finished difference Result 4196 states and 5517 transitions. [2020-11-30 01:31:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 01:31:35,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2020-11-30 01:31:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:35,996 INFO L225 Difference]: With dead ends: 4196 [2020-11-30 01:31:35,997 INFO L226 Difference]: Without dead ends: 3413 [2020-11-30 01:31:36,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2020-11-30 01:31:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2020-11-30 01:31:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 1363. [2020-11-30 01:31:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2020-11-30 01:31:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1772 transitions. [2020-11-30 01:31:36,418 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1772 transitions. Word has length 132 [2020-11-30 01:31:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:36,419 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 1772 transitions. [2020-11-30 01:31:36,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:31:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1772 transitions. [2020-11-30 01:31:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:31:36,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:36,424 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:36,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-30 01:31:36,650 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1338189673, now seen corresponding path program 1 times [2020-11-30 01:31:36,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:36,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728019880] [2020-11-30 01:31:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:37,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728019880] [2020-11-30 01:31:37,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901144748] [2020-11-30 01:31:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:37,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:31:37,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-30 01:31:37,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:31:37,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-11-30 01:31:37,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974352440] [2020-11-30 01:31:37,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:37,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:31:37,384 INFO L87 Difference]: Start difference. First operand 1363 states and 1772 transitions. Second operand 4 states. [2020-11-30 01:31:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:37,744 INFO L93 Difference]: Finished difference Result 2589 states and 3384 transitions. [2020-11-30 01:31:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:31:37,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2020-11-30 01:31:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:37,747 INFO L225 Difference]: With dead ends: 2589 [2020-11-30 01:31:37,748 INFO L226 Difference]: Without dead ends: 1314 [2020-11-30 01:31:37,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:31:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2020-11-30 01:31:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2020-11-30 01:31:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-11-30 01:31:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1701 transitions. [2020-11-30 01:31:38,124 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1701 transitions. Word has length 132 [2020-11-30 01:31:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:38,125 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1701 transitions. [2020-11-30 01:31:38,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1701 transitions. [2020-11-30 01:31:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:31:38,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:38,129 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:38,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:38,350 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash -29054437, now seen corresponding path program 1 times [2020-11-30 01:31:38,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:38,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801366838] [2020-11-30 01:31:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:38,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801366838] [2020-11-30 01:31:38,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206876159] [2020-11-30 01:31:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:38,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:31:38,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:39,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:31:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:39,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:39,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-30 01:31:39,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337266123] [2020-11-30 01:31:39,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:31:39,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:39,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:31:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:31:39,343 INFO L87 Difference]: Start difference. First operand 1314 states and 1701 transitions. Second operand 16 states. [2020-11-30 01:31:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:43,014 INFO L93 Difference]: Finished difference Result 3929 states and 5147 transitions. [2020-11-30 01:31:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 01:31:43,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 132 [2020-11-30 01:31:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:43,020 INFO L225 Difference]: With dead ends: 3929 [2020-11-30 01:31:43,021 INFO L226 Difference]: Without dead ends: 2819 [2020-11-30 01:31:43,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 01:31:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2020-11-30 01:31:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 1528. [2020-11-30 01:31:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2020-11-30 01:31:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1970 transitions. [2020-11-30 01:31:43,488 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1970 transitions. Word has length 132 [2020-11-30 01:31:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:43,489 INFO L481 AbstractCegarLoop]: Abstraction has 1528 states and 1970 transitions. [2020-11-30 01:31:43,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:31:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1970 transitions. [2020-11-30 01:31:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:31:43,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:43,495 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:43,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:43,710 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2124052381, now seen corresponding path program 1 times [2020-11-30 01:31:43,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:43,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641070707] [2020-11-30 01:31:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-30 01:31:43,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641070707] [2020-11-30 01:31:43,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:43,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:43,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609385986] [2020-11-30 01:31:43,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:43,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:43,876 INFO L87 Difference]: Start difference. First operand 1528 states and 1970 transitions. Second operand 5 states. [2020-11-30 01:31:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:44,366 INFO L93 Difference]: Finished difference Result 2802 states and 3652 transitions. [2020-11-30 01:31:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:44,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-11-30 01:31:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:44,370 INFO L225 Difference]: With dead ends: 2802 [2020-11-30 01:31:44,370 INFO L226 Difference]: Without dead ends: 1422 [2020-11-30 01:31:44,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-11-30 01:31:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2020-11-30 01:31:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2020-11-30 01:31:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1841 transitions. [2020-11-30 01:31:44,682 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1841 transitions. Word has length 132 [2020-11-30 01:31:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:44,682 INFO L481 AbstractCegarLoop]: Abstraction has 1422 states and 1841 transitions. [2020-11-30 01:31:44,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:31:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1841 transitions. [2020-11-30 01:31:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:31:44,686 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:44,687 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:44,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:31:44,687 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:44,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1824385361, now seen corresponding path program 1 times [2020-11-30 01:31:44,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:44,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338127338] [2020-11-30 01:31:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:45,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338127338] [2020-11-30 01:31:45,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190888428] [2020-11-30 01:31:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:45,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:31:45,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:45,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:31:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:45,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:45,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-30 01:31:45,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187184164] [2020-11-30 01:31:45,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:31:45,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:31:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:31:45,746 INFO L87 Difference]: Start difference. First operand 1422 states and 1841 transitions. Second operand 16 states. [2020-11-30 01:31:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:48,330 INFO L93 Difference]: Finished difference Result 4280 states and 5628 transitions. [2020-11-30 01:31:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 01:31:48,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2020-11-30 01:31:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:48,337 INFO L225 Difference]: With dead ends: 4280 [2020-11-30 01:31:48,338 INFO L226 Difference]: Without dead ends: 3082 [2020-11-30 01:31:48,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 01:31:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-11-30 01:31:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 1680. [2020-11-30 01:31:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2020-11-30 01:31:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2166 transitions. [2020-11-30 01:31:48,688 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2166 transitions. Word has length 133 [2020-11-30 01:31:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:48,688 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2166 transitions. [2020-11-30 01:31:48,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:31:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2166 transitions. [2020-11-30 01:31:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:31:48,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:48,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:48,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:48,910 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 294833065, now seen corresponding path program 1 times [2020-11-30 01:31:48,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:48,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876697188] [2020-11-30 01:31:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:49,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876697188] [2020-11-30 01:31:49,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:49,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:31:49,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543211843] [2020-11-30 01:31:49,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:31:49,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:31:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:31:49,205 INFO L87 Difference]: Start difference. First operand 1680 states and 2166 transitions. Second operand 10 states. [2020-11-30 01:31:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:50,712 INFO L93 Difference]: Finished difference Result 4193 states and 5459 transitions. [2020-11-30 01:31:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:31:50,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-11-30 01:31:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:50,719 INFO L225 Difference]: With dead ends: 4193 [2020-11-30 01:31:50,719 INFO L226 Difference]: Without dead ends: 2798 [2020-11-30 01:31:50,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2020-11-30 01:31:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2020-11-30 01:31:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 1907. [2020-11-30 01:31:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-11-30 01:31:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2450 transitions. [2020-11-30 01:31:51,148 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2450 transitions. Word has length 133 [2020-11-30 01:31:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:51,149 INFO L481 AbstractCegarLoop]: Abstraction has 1907 states and 2450 transitions. [2020-11-30 01:31:51,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:31:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2450 transitions. [2020-11-30 01:31:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:31:51,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:51,152 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:51,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 01:31:51,152 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1325873963, now seen corresponding path program 1 times [2020-11-30 01:31:51,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:51,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469121738] [2020-11-30 01:31:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-30 01:31:51,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469121738] [2020-11-30 01:31:51,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:51,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:51,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394363171] [2020-11-30 01:31:51,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:31:51,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:31:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:51,318 INFO L87 Difference]: Start difference. First operand 1907 states and 2450 transitions. Second operand 5 states. [2020-11-30 01:31:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:51,837 INFO L93 Difference]: Finished difference Result 3441 states and 4480 transitions. [2020-11-30 01:31:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:31:51,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-11-30 01:31:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:51,842 INFO L225 Difference]: With dead ends: 3441 [2020-11-30 01:31:51,842 INFO L226 Difference]: Without dead ends: 1770 [2020-11-30 01:31:51,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:31:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-11-30 01:31:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2020-11-30 01:31:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2020-11-30 01:31:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2279 transitions. [2020-11-30 01:31:52,199 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2279 transitions. Word has length 133 [2020-11-30 01:31:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:52,199 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 2279 transitions. [2020-11-30 01:31:52,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:31:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2279 transitions. [2020-11-30 01:31:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:31:52,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:52,203 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:52,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 01:31:52,203 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1847300333, now seen corresponding path program 1 times [2020-11-30 01:31:52,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:52,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232171178] [2020-11-30 01:31:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 01:31:52,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232171178] [2020-11-30 01:31:52,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:52,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:31:52,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516164094] [2020-11-30 01:31:52,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:31:52,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:31:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:52,298 INFO L87 Difference]: Start difference. First operand 1770 states and 2279 transitions. Second operand 4 states. [2020-11-30 01:31:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:52,818 INFO L93 Difference]: Finished difference Result 3194 states and 4151 transitions. [2020-11-30 01:31:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:31:52,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-11-30 01:31:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:52,822 INFO L225 Difference]: With dead ends: 3194 [2020-11-30 01:31:52,823 INFO L226 Difference]: Without dead ends: 1572 [2020-11-30 01:31:52,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:31:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2020-11-30 01:31:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1567. [2020-11-30 01:31:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-11-30 01:31:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2018 transitions. [2020-11-30 01:31:53,177 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2018 transitions. Word has length 133 [2020-11-30 01:31:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:53,180 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2018 transitions. [2020-11-30 01:31:53,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:31:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2018 transitions. [2020-11-30 01:31:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:31:53,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:53,184 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:53,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 01:31:53,185 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -561196853, now seen corresponding path program 1 times [2020-11-30 01:31:53,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:53,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860790583] [2020-11-30 01:31:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 01:31:53,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860790583] [2020-11-30 01:31:53,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:53,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:53,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510676411] [2020-11-30 01:31:53,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:31:53,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:53,357 INFO L87 Difference]: Start difference. First operand 1567 states and 2018 transitions. Second operand 6 states. [2020-11-30 01:31:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:55,200 INFO L93 Difference]: Finished difference Result 8025 states and 10558 transitions. [2020-11-30 01:31:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:31:55,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2020-11-30 01:31:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:55,214 INFO L225 Difference]: With dead ends: 8025 [2020-11-30 01:31:55,214 INFO L226 Difference]: Without dead ends: 6682 [2020-11-30 01:31:55,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:31:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2020-11-30 01:31:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 2048. [2020-11-30 01:31:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2020-11-30 01:31:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2588 transitions. [2020-11-30 01:31:55,781 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2588 transitions. Word has length 134 [2020-11-30 01:31:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:55,782 INFO L481 AbstractCegarLoop]: Abstraction has 2048 states and 2588 transitions. [2020-11-30 01:31:55,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:31:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2588 transitions. [2020-11-30 01:31:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:31:55,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:55,787 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:55,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-30 01:31:55,788 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -373807391, now seen corresponding path program 1 times [2020-11-30 01:31:55,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:55,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916167695] [2020-11-30 01:31:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:56,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916167695] [2020-11-30 01:31:56,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35395139] [2020-11-30 01:31:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:56,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-30 01:31:56,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:56,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:56,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-30 01:31:56,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790246209] [2020-11-30 01:31:56,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:31:56,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:31:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:31:56,512 INFO L87 Difference]: Start difference. First operand 2048 states and 2588 transitions. Second operand 16 states. [2020-11-30 01:31:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:59,202 INFO L93 Difference]: Finished difference Result 7467 states and 9504 transitions. [2020-11-30 01:31:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 01:31:59,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 134 [2020-11-30 01:31:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:59,214 INFO L225 Difference]: With dead ends: 7467 [2020-11-30 01:31:59,215 INFO L226 Difference]: Without dead ends: 5643 [2020-11-30 01:31:59,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2020-11-30 01:31:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2020-11-30 01:31:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 2605. [2020-11-30 01:31:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2020-11-30 01:31:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3298 transitions. [2020-11-30 01:31:59,803 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3298 transitions. Word has length 134 [2020-11-30 01:31:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:59,804 INFO L481 AbstractCegarLoop]: Abstraction has 2605 states and 3298 transitions. [2020-11-30 01:31:59,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:31:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3298 transitions. [2020-11-30 01:31:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:31:59,810 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:59,811 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:00,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-30 01:32:00,026 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2014756639, now seen corresponding path program 1 times [2020-11-30 01:32:00,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:00,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116397672] [2020-11-30 01:32:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-30 01:32:00,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116397672] [2020-11-30 01:32:00,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:00,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:32:00,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98921433] [2020-11-30 01:32:00,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:32:00,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:32:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:32:00,100 INFO L87 Difference]: Start difference. First operand 2605 states and 3298 transitions. Second operand 4 states. [2020-11-30 01:32:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:00,620 INFO L93 Difference]: Finished difference Result 4783 states and 6098 transitions. [2020-11-30 01:32:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:32:00,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-11-30 01:32:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:00,639 INFO L225 Difference]: With dead ends: 4783 [2020-11-30 01:32:00,639 INFO L226 Difference]: Without dead ends: 2355 [2020-11-30 01:32:00,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:32:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2020-11-30 01:32:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2347. [2020-11-30 01:32:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2020-11-30 01:32:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 2966 transitions. [2020-11-30 01:32:01,260 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 2966 transitions. Word has length 134 [2020-11-30 01:32:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:01,260 INFO L481 AbstractCegarLoop]: Abstraction has 2347 states and 2966 transitions. [2020-11-30 01:32:01,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:32:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 2966 transitions. [2020-11-30 01:32:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-30 01:32:01,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:01,265 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:01,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-30 01:32:01,266 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1574718058, now seen corresponding path program 1 times [2020-11-30 01:32:01,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:01,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994338462] [2020-11-30 01:32:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:01,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994338462] [2020-11-30 01:32:01,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051260493] [2020-11-30 01:32:01,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:01,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:32:01,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:01,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:32:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:02,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:02,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-11-30 01:32:02,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364104040] [2020-11-30 01:32:02,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 01:32:02,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 01:32:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:32:02,029 INFO L87 Difference]: Start difference. First operand 2347 states and 2966 transitions. Second operand 15 states. [2020-11-30 01:32:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:03,838 INFO L93 Difference]: Finished difference Result 6322 states and 8040 transitions. [2020-11-30 01:32:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:32:03,839 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2020-11-30 01:32:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:03,848 INFO L225 Difference]: With dead ends: 6322 [2020-11-30 01:32:03,849 INFO L226 Difference]: Without dead ends: 4199 [2020-11-30 01:32:03,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2020-11-30 01:32:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2020-11-30 01:32:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 2422. [2020-11-30 01:32:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2020-11-30 01:32:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3072 transitions. [2020-11-30 01:32:04,438 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3072 transitions. Word has length 135 [2020-11-30 01:32:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:04,438 INFO L481 AbstractCegarLoop]: Abstraction has 2422 states and 3072 transitions. [2020-11-30 01:32:04,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 01:32:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3072 transitions. [2020-11-30 01:32:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-30 01:32:04,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:04,442 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:04,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-11-30 01:32:04,642 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1966947596, now seen corresponding path program 1 times [2020-11-30 01:32:04,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:04,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416164351] [2020-11-30 01:32:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:04,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416164351] [2020-11-30 01:32:04,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152724429] [2020-11-30 01:32:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:05,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:32:05,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:05,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:05,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-30 01:32:05,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824067400] [2020-11-30 01:32:05,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:32:05,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:32:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:32:05,259 INFO L87 Difference]: Start difference. First operand 2422 states and 3072 transitions. Second operand 7 states. [2020-11-30 01:32:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:08,517 INFO L93 Difference]: Finished difference Result 12547 states and 16281 transitions. [2020-11-30 01:32:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:32:08,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2020-11-30 01:32:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:08,530 INFO L225 Difference]: With dead ends: 12547 [2020-11-30 01:32:08,530 INFO L226 Difference]: Without dead ends: 10349 [2020-11-30 01:32:08,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:32:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10349 states. [2020-11-30 01:32:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10349 to 3213. [2020-11-30 01:32:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3213 states. [2020-11-30 01:32:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4090 transitions. [2020-11-30 01:32:09,385 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4090 transitions. Word has length 135 [2020-11-30 01:32:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:09,385 INFO L481 AbstractCegarLoop]: Abstraction has 3213 states and 4090 transitions. [2020-11-30 01:32:09,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:32:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4090 transitions. [2020-11-30 01:32:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-30 01:32:09,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:09,389 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:09,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:09,590 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -118158588, now seen corresponding path program 1 times [2020-11-30 01:32:09,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:09,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795079134] [2020-11-30 01:32:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:09,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795079134] [2020-11-30 01:32:09,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433817439] [2020-11-30 01:32:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:10,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:32:10,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:10,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:32:10,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-30 01:32:10,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834458859] [2020-11-30 01:32:10,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:32:10,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:32:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:32:10,104 INFO L87 Difference]: Start difference. First operand 3213 states and 4090 transitions. Second operand 8 states. [2020-11-30 01:32:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:11,709 INFO L93 Difference]: Finished difference Result 7994 states and 10229 transitions. [2020-11-30 01:32:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:32:11,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2020-11-30 01:32:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:11,716 INFO L225 Difference]: With dead ends: 7994 [2020-11-30 01:32:11,716 INFO L226 Difference]: Without dead ends: 5005 [2020-11-30 01:32:11,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:32:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2020-11-30 01:32:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 3318. [2020-11-30 01:32:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2020-11-30 01:32:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4228 transitions. [2020-11-30 01:32:12,505 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4228 transitions. Word has length 135 [2020-11-30 01:32:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:12,505 INFO L481 AbstractCegarLoop]: Abstraction has 3318 states and 4228 transitions. [2020-11-30 01:32:12,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:32:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4228 transitions. [2020-11-30 01:32:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-30 01:32:12,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:12,511 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:12,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-11-30 01:32:12,723 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 71147540, now seen corresponding path program 1 times [2020-11-30 01:32:12,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:12,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920741799] [2020-11-30 01:32:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:12,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920741799] [2020-11-30 01:32:12,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996045986] [2020-11-30 01:32:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:13,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:32:13,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:13,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:32:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:13,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:13,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-11-30 01:32:13,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587678632] [2020-11-30 01:32:13,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 01:32:13,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 01:32:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:32:13,604 INFO L87 Difference]: Start difference. First operand 3318 states and 4228 transitions. Second operand 15 states. [2020-11-30 01:32:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:16,264 INFO L93 Difference]: Finished difference Result 8280 states and 10562 transitions. [2020-11-30 01:32:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-30 01:32:16,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2020-11-30 01:32:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:16,271 INFO L225 Difference]: With dead ends: 8280 [2020-11-30 01:32:16,271 INFO L226 Difference]: Without dead ends: 5186 [2020-11-30 01:32:16,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 01:32:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2020-11-30 01:32:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3356. [2020-11-30 01:32:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2020-11-30 01:32:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4276 transitions. [2020-11-30 01:32:17,117 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4276 transitions. Word has length 136 [2020-11-30 01:32:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:17,117 INFO L481 AbstractCegarLoop]: Abstraction has 3356 states and 4276 transitions. [2020-11-30 01:32:17,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 01:32:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4276 transitions. [2020-11-30 01:32:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-30 01:32:17,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:17,123 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:17,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:17,338 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 469077670, now seen corresponding path program 1 times [2020-11-30 01:32:17,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:17,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242888272] [2020-11-30 01:32:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:17,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242888272] [2020-11-30 01:32:17,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382902578] [2020-11-30 01:32:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:17,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:32:17,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:17,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:32:17,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-30 01:32:17,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030966310] [2020-11-30 01:32:17,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:32:17,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:32:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:32:17,938 INFO L87 Difference]: Start difference. First operand 3356 states and 4276 transitions. Second operand 8 states. [2020-11-30 01:32:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:19,879 INFO L93 Difference]: Finished difference Result 8900 states and 11407 transitions. [2020-11-30 01:32:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:32:19,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-11-30 01:32:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:19,885 INFO L225 Difference]: With dead ends: 8900 [2020-11-30 01:32:19,885 INFO L226 Difference]: Without dead ends: 5768 [2020-11-30 01:32:19,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:32:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2020-11-30 01:32:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 3634. [2020-11-30 01:32:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2020-11-30 01:32:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4635 transitions. [2020-11-30 01:32:20,699 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4635 transitions. Word has length 136 [2020-11-30 01:32:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:20,700 INFO L481 AbstractCegarLoop]: Abstraction has 3634 states and 4635 transitions. [2020-11-30 01:32:20,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:32:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4635 transitions. [2020-11-30 01:32:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-30 01:32:20,703 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:20,703 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:20,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:20,904 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1058232064, now seen corresponding path program 1 times [2020-11-30 01:32:20,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:20,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539241203] [2020-11-30 01:32:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:21,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539241203] [2020-11-30 01:32:21,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746387972] [2020-11-30 01:32:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:32:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:21,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:32:21,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:21,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:32:21,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-30 01:32:21,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047837452] [2020-11-30 01:32:21,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:32:21,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:32:21,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:32:21,464 INFO L87 Difference]: Start difference. First operand 3634 states and 4635 transitions. Second operand 8 states. [2020-11-30 01:32:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:23,175 INFO L93 Difference]: Finished difference Result 8549 states and 10932 transitions. [2020-11-30 01:32:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:32:23,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-11-30 01:32:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:23,181 INFO L225 Difference]: With dead ends: 8549 [2020-11-30 01:32:23,181 INFO L226 Difference]: Without dead ends: 5139 [2020-11-30 01:32:23,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:32:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2020-11-30 01:32:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 3353. [2020-11-30 01:32:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2020-11-30 01:32:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4266 transitions. [2020-11-30 01:32:23,957 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4266 transitions. Word has length 136 [2020-11-30 01:32:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:23,957 INFO L481 AbstractCegarLoop]: Abstraction has 3353 states and 4266 transitions. [2020-11-30 01:32:23,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:32:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4266 transitions. [2020-11-30 01:32:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 01:32:23,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:23,960 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:24,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-11-30 01:32:24,161 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1237288015, now seen corresponding path program 1 times [2020-11-30 01:32:24,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:24,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837564190] [2020-11-30 01:32:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:32:24,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837564190] [2020-11-30 01:32:24,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:32:24,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:32:24,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745818874] [2020-11-30 01:32:24,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:32:24,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:32:24,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:32:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:32:24,350 INFO L87 Difference]: Start difference. First operand 3353 states and 4266 transitions. Second operand 6 states. [2020-11-30 01:32:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:25,707 INFO L93 Difference]: Finished difference Result 8578 states and 11082 transitions. [2020-11-30 01:32:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:32:25,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2020-11-30 01:32:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:32:25,712 INFO L225 Difference]: With dead ends: 8578 [2020-11-30 01:32:25,712 INFO L226 Difference]: Without dead ends: 5431 [2020-11-30 01:32:25,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:32:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2020-11-30 01:32:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3353. [2020-11-30 01:32:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2020-11-30 01:32:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4263 transitions. [2020-11-30 01:32:26,696 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4263 transitions. Word has length 137 [2020-11-30 01:32:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:32:26,696 INFO L481 AbstractCegarLoop]: Abstraction has 3353 states and 4263 transitions. [2020-11-30 01:32:26,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:32:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4263 transitions. [2020-11-30 01:32:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 01:32:26,699 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:32:26,699 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:26,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-30 01:32:26,699 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:32:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash -531708588, now seen corresponding path program 1 times [2020-11-30 01:32:26,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:26,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951493349] [2020-11-30 01:32:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:26,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:26,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:26,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:26,928 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:32:26,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-30 01:32:27,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:32:27 BoogieIcfgContainer [2020-11-30 01:32:27,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:32:27,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:32:27,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:32:27,187 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:32:27,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:15" (3/4) ... [2020-11-30 01:32:27,190 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:32:27,534 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_195aeff1-8d13-4b2d-a469-032a0d466468/bin/uautomizer/witness.graphml [2020-11-30 01:32:27,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:32:27,537 INFO L168 Benchmark]: Toolchain (without parser) took 75139.25 ms. Allocated memory was 86.0 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 53.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 541.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,537 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 86.0 MB. Free memory was 47.4 MB in the beginning and 47.4 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:32:27,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.18 ms. Allocated memory is still 86.0 MB. Free memory was 53.6 MB in the beginning and 56.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.57 ms. Allocated memory is still 86.0 MB. Free memory was 56.8 MB in the beginning and 51.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,539 INFO L168 Benchmark]: Boogie Preprocessor took 96.84 ms. Allocated memory is still 86.0 MB. Free memory was 51.9 MB in the beginning and 48.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,539 INFO L168 Benchmark]: RCFGBuilder took 1704.04 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 48.0 MB in the beginning and 45.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,540 INFO L168 Benchmark]: TraceAbstraction took 72154.01 ms. Allocated memory was 104.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 45.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 470.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,540 INFO L168 Benchmark]: Witness Printer took 350.63 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:27,544 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64 ms. Allocated memory is still 86.0 MB. Free memory was 47.4 MB in the beginning and 47.4 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 705.18 ms. Allocated memory is still 86.0 MB. Free memory was 53.6 MB in the beginning and 56.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 114.57 ms. Allocated memory is still 86.0 MB. Free memory was 56.8 MB in the beginning and 51.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.84 ms. Allocated memory is still 86.0 MB. Free memory was 51.9 MB in the beginning and 48.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1704.04 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 48.0 MB in the beginning and 45.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 72154.01 ms. Allocated memory was 104.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 45.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 470.9 MB. Max. memory is 16.1 GB. * Witness Printer took 350.63 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] i2 = init() [L58] COND FALSE !(!cond) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE 1 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L529] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE 1 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-128, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-128, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-128, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L608] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 317 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 71.8s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 40.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22208 SDtfs, 35769 SDslu, 74002 SDs, 0 SdLazy, 12219 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2019 GetRequests, 1544 SyntacticMatches, 15 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3634occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.8s AutomataMinimizationTime, 46 MinimizatonAttempts, 44007 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 5904 NumberOfCodeBlocks, 5904 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5706 ConstructedInterpolants, 76 QuantifiedInterpolants, 3457638 SizeOfPredicates, 44 NumberOfNonLiveVariables, 8690 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 57 InterpolantComputations, 39 PerfectInterpolantSequences, 835/1063 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...