./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.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_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 20:41:49,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:41:49,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:41:50,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:41:50,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:41:50,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:41:50,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:41:50,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:41:50,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:41:50,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:41:50,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:41:50,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:41:50,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:41:50,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:41:50,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:41:50,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:41:50,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:41:50,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:41:50,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:41:50,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:41:50,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:41:50,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:41:50,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:41:50,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:41:50,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:41:50,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:41:50,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:41:50,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:41:50,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:41:50,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:41:50,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:41:50,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:41:50,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:41:50,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:41:50,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:41:50,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:41:50,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:41:50,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:41:50,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:41:50,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:41:50,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:41:50,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:41:50,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:41:50,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:41:50,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:41:50,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:41:50,109 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:41:50,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:41:50,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:41:50,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:41:50,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:41:50,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:41:50,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:41:50,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:41:50,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:41:50,111 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:41:50,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:41:50,112 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:41:50,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:41:50,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:41:50,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:41:50,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:41:50,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:41:50,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:41:50,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:41:50,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:41:50,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:41:50,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:41:50,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:41:50,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:41:50,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:41:50,115 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_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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 -> 4232b4ba156e25efb1c3d6c50a48cd7b8244ddaf [2020-11-29 20:41:50,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:41:50,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:41:50,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:41:50,512 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:41:50,514 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:41:50,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-29 20:41:50,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/data/0da8b48cd/c6643c25c5404d378ed1da59e0d9b49e/FLAG246373b66 [2020-11-29 20:41:51,264 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:41:51,265 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-29 20:41:51,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/data/0da8b48cd/c6643c25c5404d378ed1da59e0d9b49e/FLAG246373b66 [2020-11-29 20:41:51,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/data/0da8b48cd/c6643c25c5404d378ed1da59e0d9b49e [2020-11-29 20:41:51,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:41:51,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:41:51,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:41:51,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:41:51,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:41:51,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:41:51" (1/1) ... [2020-11-29 20:41:51,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc99508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:51, skipping insertion in model container [2020-11-29 20:41:51,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:41:51" (1/1) ... [2020-11-29 20:41:51,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:41:51,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:41:51,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:41:51,951 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:41:52,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:41:52,113 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:41:52,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52 WrapperNode [2020-11-29 20:41:52,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:41:52,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:41:52,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:41:52,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:41:52,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:41:52,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:41:52,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:41:52,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:41:52,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... [2020-11-29 20:41:52,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:41:52,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:41:52,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:41:52,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:41:52,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:41:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:41:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:41:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:41:52,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:41:54,099 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:41:54,100 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-29 20:41:54,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:41:54 BoogieIcfgContainer [2020-11-29 20:41:54,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:41:54,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:41:54,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:41:54,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:41:54,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:41:51" (1/3) ... [2020-11-29 20:41:54,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41123e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:41:54, skipping insertion in model container [2020-11-29 20:41:54,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:41:52" (2/3) ... [2020-11-29 20:41:54,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41123e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:41:54, skipping insertion in model container [2020-11-29 20:41:54,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:41:54" (3/3) ... [2020-11-29 20:41:54,115 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-11-29 20:41:54,128 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:41:54,135 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-29 20:41:54,148 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-29 20:41:54,185 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:41:54,185 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:41:54,185 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:41:54,185 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:41:54,185 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:41:54,186 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:41:54,186 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:41:54,186 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:41:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states. [2020-11-29 20:41:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-29 20:41:54,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:54,225 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-29 20:41:54,226 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-29 20:41:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-11-29 20:41:54,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:54,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017644000] [2020-11-29 20:41:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:54,516 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-29 20:41:54,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017644000] [2020-11-29 20:41:54,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:54,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:41:54,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292812608] [2020-11-29 20:41:54,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 20:41:54,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:54,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 20:41:54,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 20:41:54,543 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 2 states. [2020-11-29 20:41:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:54,608 INFO L93 Difference]: Finished difference Result 597 states and 916 transitions. [2020-11-29 20:41:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 20:41:54,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-11-29 20:41:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:54,631 INFO L225 Difference]: With dead ends: 597 [2020-11-29 20:41:54,634 INFO L226 Difference]: Without dead ends: 291 [2020-11-29 20:41:54,645 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-29 20:41:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-29 20:41:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-11-29 20:41:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-11-29 20:41:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-11-29 20:41:54,754 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 33 [2020-11-29 20:41:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:54,755 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-11-29 20:41:54,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 20:41:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2020-11-29 20:41:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-29 20:41:54,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:54,759 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-29 20:41:54,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:41:54,761 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-29 20:41:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-11-29 20:41:54,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:54,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374142042] [2020-11-29 20:41:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:54,912 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-29 20:41:54,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374142042] [2020-11-29 20:41:54,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:54,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:41:54,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385277025] [2020-11-29 20:41:54,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:41:54,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:41:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:41:54,915 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2020-11-29 20:41:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:55,015 INFO L93 Difference]: Finished difference Result 568 states and 824 transitions. [2020-11-29 20:41:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:41:55,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-29 20:41:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:55,026 INFO L225 Difference]: With dead ends: 568 [2020-11-29 20:41:55,030 INFO L226 Difference]: Without dead ends: 291 [2020-11-29 20:41:55,032 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-29 20:41:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-29 20:41:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-11-29 20:41:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-11-29 20:41:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2020-11-29 20:41:55,070 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 33 [2020-11-29 20:41:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:55,070 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2020-11-29 20:41:55,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:41:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2020-11-29 20:41:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-29 20:41:55,078 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:55,078 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-29 20:41:55,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:41:55,080 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-29 20:41:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-11-29 20:41:55,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:55,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339800367] [2020-11-29 20:41:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:55,272 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-29 20:41:55,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339800367] [2020-11-29 20:41:55,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:55,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:55,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283732881] [2020-11-29 20:41:55,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:55,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:55,275 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand 3 states. [2020-11-29 20:41:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:55,343 INFO L93 Difference]: Finished difference Result 599 states and 859 transitions. [2020-11-29 20:41:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:55,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-11-29 20:41:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:55,347 INFO L225 Difference]: With dead ends: 599 [2020-11-29 20:41:55,347 INFO L226 Difference]: Without dead ends: 325 [2020-11-29 20:41:55,348 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-29 20:41:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-11-29 20:41:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 267. [2020-11-29 20:41:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-11-29 20:41:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2020-11-29 20:41:55,367 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 44 [2020-11-29 20:41:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:55,368 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2020-11-29 20:41:55,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2020-11-29 20:41:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 20:41:55,374 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:55,374 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-29 20:41:55,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:41:55,376 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-29 20:41:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-11-29 20:41:55,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:55,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190456371] [2020-11-29 20:41:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:55,548 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-29 20:41:55,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190456371] [2020-11-29 20:41:55,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:55,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:55,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099573069] [2020-11-29 20:41:55,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:55,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:55,552 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand 3 states. [2020-11-29 20:41:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:55,599 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2020-11-29 20:41:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:55,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-11-29 20:41:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:55,604 INFO L225 Difference]: With dead ends: 744 [2020-11-29 20:41:55,605 INFO L226 Difference]: Without dead ends: 494 [2020-11-29 20:41:55,606 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-29 20:41:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-11-29 20:41:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 300. [2020-11-29 20:41:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-11-29 20:41:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2020-11-29 20:41:55,632 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 53 [2020-11-29 20:41:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:55,634 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2020-11-29 20:41:55,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2020-11-29 20:41:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 20:41:55,638 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:55,638 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-29 20:41:55,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:41:55,639 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-29 20:41:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1464669016, now seen corresponding path program 1 times [2020-11-29 20:41:55,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:55,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863137630] [2020-11-29 20:41:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:55,750 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-29 20:41:55,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863137630] [2020-11-29 20:41:55,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:55,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:55,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653482222] [2020-11-29 20:41:55,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:55,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:55,753 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand 3 states. [2020-11-29 20:41:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:55,806 INFO L93 Difference]: Finished difference Result 822 states and 1175 transitions. [2020-11-29 20:41:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:55,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-29 20:41:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:55,811 INFO L225 Difference]: With dead ends: 822 [2020-11-29 20:41:55,811 INFO L226 Difference]: Without dead ends: 539 [2020-11-29 20:41:55,813 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-29 20:41:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-11-29 20:41:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 321. [2020-11-29 20:41:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-11-29 20:41:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2020-11-29 20:41:55,833 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 54 [2020-11-29 20:41:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:55,844 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2020-11-29 20:41:55,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2020-11-29 20:41:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 20:41:55,845 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:55,848 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-29 20:41:55,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:41:55,849 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-29 20:41:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -784610646, now seen corresponding path program 1 times [2020-11-29 20:41:55,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:55,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78105774] [2020-11-29 20:41:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:55,991 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-29 20:41:55,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78105774] [2020-11-29 20:41:55,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:55,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:41:55,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833692848] [2020-11-29 20:41:55,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:41:55,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:55,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:41:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:41:55,999 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand 5 states. [2020-11-29 20:41:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:56,345 INFO L93 Difference]: Finished difference Result 1003 states and 1436 transitions. [2020-11-29 20:41:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:41:56,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-11-29 20:41:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:56,352 INFO L225 Difference]: With dead ends: 1003 [2020-11-29 20:41:56,352 INFO L226 Difference]: Without dead ends: 699 [2020-11-29 20:41:56,353 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-29 20:41:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-11-29 20:41:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-11-29 20:41:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-29 20:41:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 592 transitions. [2020-11-29 20:41:56,379 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 592 transitions. Word has length 54 [2020-11-29 20:41:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:56,383 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 592 transitions. [2020-11-29 20:41:56,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:41:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 592 transitions. [2020-11-29 20:41:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-29 20:41:56,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:56,385 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-29 20:41:56,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:41:56,385 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-29 20:41:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1195121816, now seen corresponding path program 1 times [2020-11-29 20:41:56,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:56,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499612034] [2020-11-29 20:41:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:56,478 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-29 20:41:56,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499612034] [2020-11-29 20:41:56,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:56,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:41:56,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806948676] [2020-11-29 20:41:56,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:41:56,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:41:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:41:56,480 INFO L87 Difference]: Start difference. First operand 419 states and 592 transitions. Second operand 5 states. [2020-11-29 20:41:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:56,762 INFO L93 Difference]: Finished difference Result 1003 states and 1428 transitions. [2020-11-29 20:41:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:41:56,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-11-29 20:41:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:56,767 INFO L225 Difference]: With dead ends: 1003 [2020-11-29 20:41:56,767 INFO L226 Difference]: Without dead ends: 699 [2020-11-29 20:41:56,768 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-29 20:41:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-11-29 20:41:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-11-29 20:41:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-29 20:41:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2020-11-29 20:41:56,793 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 55 [2020-11-29 20:41:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:56,794 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2020-11-29 20:41:56,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:41:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2020-11-29 20:41:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 20:41:56,795 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:56,795 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-29 20:41:56,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:41:56,795 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-29 20:41:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-11-29 20:41:56,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:56,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988240170] [2020-11-29 20:41:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:56,899 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-29 20:41:56,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988240170] [2020-11-29 20:41:56,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:56,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:56,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113471411] [2020-11-29 20:41:56,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:56,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:56,902 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2020-11-29 20:41:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:56,949 INFO L93 Difference]: Finished difference Result 843 states and 1199 transitions. [2020-11-29 20:41:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:56,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-29 20:41:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:56,954 INFO L225 Difference]: With dead ends: 843 [2020-11-29 20:41:56,954 INFO L226 Difference]: Without dead ends: 539 [2020-11-29 20:41:56,955 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-29 20:41:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-11-29 20:41:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 414. [2020-11-29 20:41:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-11-29 20:41:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 580 transitions. [2020-11-29 20:41:56,982 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 580 transitions. Word has length 56 [2020-11-29 20:41:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:56,983 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 580 transitions. [2020-11-29 20:41:56,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 580 transitions. [2020-11-29 20:41:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-29 20:41:56,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:56,985 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-29 20:41:56,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:41:56,985 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-29 20:41:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 819502993, now seen corresponding path program 1 times [2020-11-29 20:41:56,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:56,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332801555] [2020-11-29 20:41:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:57,061 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-29 20:41:57,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332801555] [2020-11-29 20:41:57,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:57,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:57,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649092316] [2020-11-29 20:41:57,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:57,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:57,063 INFO L87 Difference]: Start difference. First operand 414 states and 580 transitions. Second operand 3 states. [2020-11-29 20:41:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:57,157 INFO L93 Difference]: Finished difference Result 842 states and 1198 transitions. [2020-11-29 20:41:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:57,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-29 20:41:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:57,161 INFO L225 Difference]: With dead ends: 842 [2020-11-29 20:41:57,162 INFO L226 Difference]: Without dead ends: 543 [2020-11-29 20:41:57,163 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-29 20:41:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-11-29 20:41:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 394. [2020-11-29 20:41:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-11-29 20:41:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2020-11-29 20:41:57,198 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 60 [2020-11-29 20:41:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:57,199 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2020-11-29 20:41:57,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2020-11-29 20:41:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:41:57,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:57,200 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-29 20:41:57,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:41:57,200 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-29 20:41:57,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash -69192917, now seen corresponding path program 1 times [2020-11-29 20:41:57,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:57,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069838811] [2020-11-29 20:41:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:57,293 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-29 20:41:57,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069838811] [2020-11-29 20:41:57,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:57,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:57,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277906513] [2020-11-29 20:41:57,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:57,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:57,296 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand 3 states. [2020-11-29 20:41:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:57,365 INFO L93 Difference]: Finished difference Result 810 states and 1142 transitions. [2020-11-29 20:41:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:57,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-29 20:41:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:57,370 INFO L225 Difference]: With dead ends: 810 [2020-11-29 20:41:57,370 INFO L226 Difference]: Without dead ends: 531 [2020-11-29 20:41:57,371 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-29 20:41:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-11-29 20:41:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-11-29 20:41:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-29 20:41:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 530 transitions. [2020-11-29 20:41:57,394 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 530 transitions. Word has length 64 [2020-11-29 20:41:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:57,394 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 530 transitions. [2020-11-29 20:41:57,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 530 transitions. [2020-11-29 20:41:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 20:41:57,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:57,395 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-29 20:41:57,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:41:57,396 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-29 20:41:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1588224041, now seen corresponding path program 1 times [2020-11-29 20:41:57,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:57,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648854560] [2020-11-29 20:41:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:57,478 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-29 20:41:57,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648854560] [2020-11-29 20:41:57,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:57,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:41:57,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222543485] [2020-11-29 20:41:57,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:41:57,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:41:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:41:57,481 INFO L87 Difference]: Start difference. First operand 382 states and 530 transitions. Second operand 6 states. [2020-11-29 20:41:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:57,666 INFO L93 Difference]: Finished difference Result 1412 states and 1981 transitions. [2020-11-29 20:41:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:41:57,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-11-29 20:41:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:57,674 INFO L225 Difference]: With dead ends: 1412 [2020-11-29 20:41:57,675 INFO L226 Difference]: Without dead ends: 1145 [2020-11-29 20:41:57,676 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-29 20:41:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-11-29 20:41:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 403. [2020-11-29 20:41:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-29 20:41:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 554 transitions. [2020-11-29 20:41:57,709 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 554 transitions. Word has length 65 [2020-11-29 20:41:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:57,710 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 554 transitions. [2020-11-29 20:41:57,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:41:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 554 transitions. [2020-11-29 20:41:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-29 20:41:57,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:57,717 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-29 20:41:57,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:41:57,728 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-29 20:41:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1255523790, now seen corresponding path program 1 times [2020-11-29 20:41:57,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:57,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131871909] [2020-11-29 20:41:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:57,811 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-29 20:41:57,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131871909] [2020-11-29 20:41:57,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:57,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:57,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799405635] [2020-11-29 20:41:57,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:57,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:57,815 INFO L87 Difference]: Start difference. First operand 403 states and 554 transitions. Second operand 3 states. [2020-11-29 20:41:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:57,922 INFO L93 Difference]: Finished difference Result 827 states and 1158 transitions. [2020-11-29 20:41:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:57,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-11-29 20:41:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:57,926 INFO L225 Difference]: With dead ends: 827 [2020-11-29 20:41:57,926 INFO L226 Difference]: Without dead ends: 560 [2020-11-29 20:41:57,927 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-29 20:41:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-11-29 20:41:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-11-29 20:41:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-29 20:41:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2020-11-29 20:41:57,960 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 67 [2020-11-29 20:41:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:57,960 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2020-11-29 20:41:57,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2020-11-29 20:41:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 20:41:57,961 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:57,962 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-29 20:41:57,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 20:41:57,962 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-29 20:41:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash -363592984, now seen corresponding path program 1 times [2020-11-29 20:41:57,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:57,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948437391] [2020-11-29 20:41:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:58,022 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-29 20:41:58,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948437391] [2020-11-29 20:41:58,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:58,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:58,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810431315] [2020-11-29 20:41:58,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:58,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:58,026 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 3 states. [2020-11-29 20:41:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:58,112 INFO L93 Difference]: Finished difference Result 795 states and 1102 transitions. [2020-11-29 20:41:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:58,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-11-29 20:41:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:58,117 INFO L225 Difference]: With dead ends: 795 [2020-11-29 20:41:58,117 INFO L226 Difference]: Without dead ends: 548 [2020-11-29 20:41:58,118 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-29 20:41:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-11-29 20:41:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2020-11-29 20:41:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-11-29 20:41:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions. [2020-11-29 20:41:58,146 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 71 [2020-11-29 20:41:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:58,146 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 504 transitions. [2020-11-29 20:41:58,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:41:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions. [2020-11-29 20:41:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 20:41:58,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:58,147 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-29 20:41:58,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:41:58,148 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-29 20:41:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2014081046, now seen corresponding path program 1 times [2020-11-29 20:41:58,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:58,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584185092] [2020-11-29 20:41:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:58,396 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-29 20:41:58,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584185092] [2020-11-29 20:41:58,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:58,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:41:58,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076184568] [2020-11-29 20:41:58,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:41:58,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:41:58,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:41:58,398 INFO L87 Difference]: Start difference. First operand 371 states and 504 transitions. Second operand 6 states. [2020-11-29 20:41:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:58,668 INFO L93 Difference]: Finished difference Result 1063 states and 1470 transitions. [2020-11-29 20:41:58,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:41:58,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-29 20:41:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:58,673 INFO L225 Difference]: With dead ends: 1063 [2020-11-29 20:41:58,673 INFO L226 Difference]: Without dead ends: 828 [2020-11-29 20:41:58,674 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-29 20:41:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-11-29 20:41:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 396. [2020-11-29 20:41:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-11-29 20:41:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 539 transitions. [2020-11-29 20:41:58,709 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 539 transitions. Word has length 74 [2020-11-29 20:41:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:58,710 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 539 transitions. [2020-11-29 20:41:58,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:41:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 539 transitions. [2020-11-29 20:41:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 20:41:58,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:58,711 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-29 20:41:58,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:41:58,712 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-29 20:41:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1105027455, now seen corresponding path program 1 times [2020-11-29 20:41:58,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:58,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468223696] [2020-11-29 20:41:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:58,850 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-29 20:41:58,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468223696] [2020-11-29 20:41:58,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:58,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:41:58,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114333663] [2020-11-29 20:41:58,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:41:58,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:41:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:41:58,853 INFO L87 Difference]: Start difference. First operand 396 states and 539 transitions. Second operand 6 states. [2020-11-29 20:41:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:59,311 INFO L93 Difference]: Finished difference Result 1384 states and 1903 transitions. [2020-11-29 20:41:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:41:59,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-11-29 20:41:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:59,318 INFO L225 Difference]: With dead ends: 1384 [2020-11-29 20:41:59,319 INFO L226 Difference]: Without dead ends: 1131 [2020-11-29 20:41:59,320 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-29 20:41:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2020-11-29 20:41:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 424. [2020-11-29 20:41:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-29 20:41:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2020-11-29 20:41:59,364 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 74 [2020-11-29 20:41:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:59,364 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2020-11-29 20:41:59,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:41:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2020-11-29 20:41:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 20:41:59,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:59,365 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-29 20:41:59,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:41:59,366 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-29 20:41:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-11-29 20:41:59,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:59,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353696728] [2020-11-29 20:41:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:59,419 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-29 20:41:59,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353696728] [2020-11-29 20:41:59,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:59,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:41:59,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785997431] [2020-11-29 20:41:59,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:41:59,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:41:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:41:59,422 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand 4 states. [2020-11-29 20:41:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:59,638 INFO L93 Difference]: Finished difference Result 1099 states and 1491 transitions. [2020-11-29 20:41:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:41:59,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-29 20:41:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:59,644 INFO L225 Difference]: With dead ends: 1099 [2020-11-29 20:41:59,644 INFO L226 Difference]: Without dead ends: 840 [2020-11-29 20:41:59,645 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-29 20:41:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-11-29 20:41:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 637. [2020-11-29 20:41:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-11-29 20:41:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 846 transitions. [2020-11-29 20:41:59,732 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 846 transitions. Word has length 74 [2020-11-29 20:41:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:41:59,733 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 846 transitions. [2020-11-29 20:41:59,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:41:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 846 transitions. [2020-11-29 20:41:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-29 20:41:59,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:41:59,735 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-29 20:41:59,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 20:41:59,736 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-29 20:41:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:41:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1739304111, now seen corresponding path program 1 times [2020-11-29 20:41:59,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:41:59,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911419230] [2020-11-29 20:41:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:41:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:41:59,838 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-29 20:41:59,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911419230] [2020-11-29 20:41:59,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:41:59,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:41:59,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284798736] [2020-11-29 20:41:59,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:41:59,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:41:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:41:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:41:59,842 INFO L87 Difference]: Start difference. First operand 637 states and 846 transitions. Second operand 3 states. [2020-11-29 20:41:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:41:59,955 INFO L93 Difference]: Finished difference Result 1118 states and 1514 transitions. [2020-11-29 20:41:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:41:59,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-11-29 20:41:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:41:59,959 INFO L225 Difference]: With dead ends: 1118 [2020-11-29 20:41:59,960 INFO L226 Difference]: Without dead ends: 748 [2020-11-29 20:41:59,961 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-29 20:41:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-11-29 20:42:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 633. [2020-11-29 20:42:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-11-29 20:42:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 839 transitions. [2020-11-29 20:42:00,021 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 839 transitions. Word has length 75 [2020-11-29 20:42:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:00,022 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 839 transitions. [2020-11-29 20:42:00,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:42:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 839 transitions. [2020-11-29 20:42:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-29 20:42:00,023 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:42:00,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 20:42:00,024 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-29 20:42:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash -450501806, now seen corresponding path program 1 times [2020-11-29 20:42:00,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:00,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717037094] [2020-11-29 20:42:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:00,087 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-29 20:42:00,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717037094] [2020-11-29 20:42:00,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:00,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:00,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112780097] [2020-11-29 20:42:00,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:00,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:00,096 INFO L87 Difference]: Start difference. First operand 633 states and 839 transitions. Second operand 4 states. [2020-11-29 20:42:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:00,340 INFO L93 Difference]: Finished difference Result 1425 states and 1907 transitions. [2020-11-29 20:42:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:00,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-11-29 20:42:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:00,347 INFO L225 Difference]: With dead ends: 1425 [2020-11-29 20:42:00,347 INFO L226 Difference]: Without dead ends: 1045 [2020-11-29 20:42:00,348 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-29 20:42:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-11-29 20:42:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 844. [2020-11-29 20:42:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2020-11-29 20:42:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1109 transitions. [2020-11-29 20:42:00,430 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1109 transitions. Word has length 76 [2020-11-29 20:42:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:00,431 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1109 transitions. [2020-11-29 20:42:00,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1109 transitions. [2020-11-29 20:42:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-29 20:42:00,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:00,433 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-29 20:42:00,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:42:00,434 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-29 20:42:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1063318036, now seen corresponding path program 1 times [2020-11-29 20:42:00,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:00,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444252330] [2020-11-29 20:42:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:00,558 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-29 20:42:00,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444252330] [2020-11-29 20:42:00,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:00,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:00,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051013250] [2020-11-29 20:42:00,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:00,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:00,561 INFO L87 Difference]: Start difference. First operand 844 states and 1109 transitions. Second operand 6 states. [2020-11-29 20:42:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:01,224 INFO L93 Difference]: Finished difference Result 3164 states and 4201 transitions. [2020-11-29 20:42:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:42:01,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-11-29 20:42:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:01,240 INFO L225 Difference]: With dead ends: 3164 [2020-11-29 20:42:01,240 INFO L226 Difference]: Without dead ends: 2657 [2020-11-29 20:42:01,242 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-29 20:42:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2020-11-29 20:42:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 970. [2020-11-29 20:42:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-11-29 20:42:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1256 transitions. [2020-11-29 20:42:01,352 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1256 transitions. Word has length 76 [2020-11-29 20:42:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:01,353 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1256 transitions. [2020-11-29 20:42:01,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1256 transitions. [2020-11-29 20:42:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-29 20:42:01,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:01,355 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-29 20:42:01,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 20:42:01,355 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-29 20:42:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-11-29 20:42:01,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:01,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926814297] [2020-11-29 20:42:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:01,436 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-29 20:42:01,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926814297] [2020-11-29 20:42:01,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:01,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:01,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813004850] [2020-11-29 20:42:01,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:01,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:01,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:01,438 INFO L87 Difference]: Start difference. First operand 970 states and 1256 transitions. Second operand 4 states. [2020-11-29 20:42:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:01,705 INFO L93 Difference]: Finished difference Result 2345 states and 3078 transitions. [2020-11-29 20:42:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:01,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-11-29 20:42:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:01,714 INFO L225 Difference]: With dead ends: 2345 [2020-11-29 20:42:01,714 INFO L226 Difference]: Without dead ends: 1790 [2020-11-29 20:42:01,716 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-29 20:42:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-11-29 20:42:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1311. [2020-11-29 20:42:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2020-11-29 20:42:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1691 transitions. [2020-11-29 20:42:01,838 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1691 transitions. Word has length 77 [2020-11-29 20:42:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:01,838 INFO L481 AbstractCegarLoop]: Abstraction has 1311 states and 1691 transitions. [2020-11-29 20:42:01,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1691 transitions. [2020-11-29 20:42:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-29 20:42:01,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:01,840 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-29 20:42:01,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 20:42:01,841 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-29 20:42:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash 236706532, now seen corresponding path program 1 times [2020-11-29 20:42:01,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:01,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84128320] [2020-11-29 20:42:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:01,878 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-29 20:42:01,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84128320] [2020-11-29 20:42:01,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:01,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:42:01,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691653677] [2020-11-29 20:42:01,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:42:01,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:42:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:42:01,881 INFO L87 Difference]: Start difference. First operand 1311 states and 1691 transitions. Second operand 3 states. [2020-11-29 20:42:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:02,202 INFO L93 Difference]: Finished difference Result 3105 states and 4022 transitions. [2020-11-29 20:42:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:42:02,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-11-29 20:42:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:02,214 INFO L225 Difference]: With dead ends: 3105 [2020-11-29 20:42:02,214 INFO L226 Difference]: Without dead ends: 2156 [2020-11-29 20:42:02,216 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-29 20:42:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2020-11-29 20:42:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1313. [2020-11-29 20:42:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2020-11-29 20:42:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1693 transitions. [2020-11-29 20:42:02,344 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1693 transitions. Word has length 78 [2020-11-29 20:42:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:02,345 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1693 transitions. [2020-11-29 20:42:02,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:42:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1693 transitions. [2020-11-29 20:42:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-29 20:42:02,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:02,347 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-29 20:42:02,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 20:42:02,347 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-29 20:42:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1666890696, now seen corresponding path program 1 times [2020-11-29 20:42:02,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:02,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161008067] [2020-11-29 20:42:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:02,447 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-29 20:42:02,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161008067] [2020-11-29 20:42:02,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:02,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:02,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362388475] [2020-11-29 20:42:02,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:02,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:02,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:02,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:02,449 INFO L87 Difference]: Start difference. First operand 1313 states and 1693 transitions. Second operand 6 states. [2020-11-29 20:42:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:02,790 INFO L93 Difference]: Finished difference Result 2077 states and 2712 transitions. [2020-11-29 20:42:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:42:02,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-29 20:42:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:02,801 INFO L225 Difference]: With dead ends: 2077 [2020-11-29 20:42:02,801 INFO L226 Difference]: Without dead ends: 2075 [2020-11-29 20:42:02,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-29 20:42:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-11-29 20:42:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1315. [2020-11-29 20:42:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-11-29 20:42:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1695 transitions. [2020-11-29 20:42:02,932 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1695 transitions. Word has length 79 [2020-11-29 20:42:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:02,933 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1695 transitions. [2020-11-29 20:42:02,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1695 transitions. [2020-11-29 20:42:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-29 20:42:02,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:02,935 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-29 20:42:02,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 20:42:02,935 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-29 20:42:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -275805135, now seen corresponding path program 1 times [2020-11-29 20:42:02,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:02,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929748303] [2020-11-29 20:42:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:03,058 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-29 20:42:03,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929748303] [2020-11-29 20:42:03,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:03,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:03,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286073328] [2020-11-29 20:42:03,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:03,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:03,061 INFO L87 Difference]: Start difference. First operand 1315 states and 1695 transitions. Second operand 6 states. [2020-11-29 20:42:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:03,558 INFO L93 Difference]: Finished difference Result 3115 states and 4121 transitions. [2020-11-29 20:42:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:42:03,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-11-29 20:42:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:03,571 INFO L225 Difference]: With dead ends: 3115 [2020-11-29 20:42:03,571 INFO L226 Difference]: Without dead ends: 2320 [2020-11-29 20:42:03,573 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-29 20:42:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2020-11-29 20:42:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1315. [2020-11-29 20:42:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-11-29 20:42:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1683 transitions. [2020-11-29 20:42:03,712 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1683 transitions. Word has length 79 [2020-11-29 20:42:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:03,713 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1683 transitions. [2020-11-29 20:42:03,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1683 transitions. [2020-11-29 20:42:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-29 20:42:03,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:03,715 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-29 20:42:03,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 20:42:03,722 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-29 20:42:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1725608005, now seen corresponding path program 1 times [2020-11-29 20:42:03,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:03,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340556141] [2020-11-29 20:42:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:03,814 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-29 20:42:03,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340556141] [2020-11-29 20:42:03,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:03,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:03,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685584052] [2020-11-29 20:42:03,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:03,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:03,819 INFO L87 Difference]: Start difference. First operand 1315 states and 1683 transitions. Second operand 4 states. [2020-11-29 20:42:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:04,051 INFO L93 Difference]: Finished difference Result 2627 states and 3386 transitions. [2020-11-29 20:42:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:04,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-11-29 20:42:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:04,058 INFO L225 Difference]: With dead ends: 2627 [2020-11-29 20:42:04,059 INFO L226 Difference]: Without dead ends: 1384 [2020-11-29 20:42:04,060 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-29 20:42:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-11-29 20:42:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1027. [2020-11-29 20:42:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2020-11-29 20:42:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1327 transitions. [2020-11-29 20:42:04,179 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1327 transitions. Word has length 79 [2020-11-29 20:42:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:04,180 INFO L481 AbstractCegarLoop]: Abstraction has 1027 states and 1327 transitions. [2020-11-29 20:42:04,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1327 transitions. [2020-11-29 20:42:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-29 20:42:04,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:04,182 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-29 20:42:04,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 20:42:04,182 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-29 20:42:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:04,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-11-29 20:42:04,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:04,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552987726] [2020-11-29 20:42:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:04,232 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-29 20:42:04,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552987726] [2020-11-29 20:42:04,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:04,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:42:04,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611294263] [2020-11-29 20:42:04,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:42:04,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:42:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:42:04,235 INFO L87 Difference]: Start difference. First operand 1027 states and 1327 transitions. Second operand 3 states. [2020-11-29 20:42:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:04,568 INFO L93 Difference]: Finished difference Result 2433 states and 3163 transitions. [2020-11-29 20:42:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:42:04,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-11-29 20:42:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:04,577 INFO L225 Difference]: With dead ends: 2433 [2020-11-29 20:42:04,577 INFO L226 Difference]: Without dead ends: 1550 [2020-11-29 20:42:04,579 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-29 20:42:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2020-11-29 20:42:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1033. [2020-11-29 20:42:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-11-29 20:42:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1333 transitions. [2020-11-29 20:42:04,696 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1333 transitions. Word has length 80 [2020-11-29 20:42:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:04,696 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 1333 transitions. [2020-11-29 20:42:04,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:42:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1333 transitions. [2020-11-29 20:42:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-29 20:42:04,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:04,698 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-29 20:42:04,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 20:42:04,698 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-29 20:42:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1203231905, now seen corresponding path program 1 times [2020-11-29 20:42:04,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:04,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125611985] [2020-11-29 20:42:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:04,783 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-29 20:42:04,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125611985] [2020-11-29 20:42:04,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:04,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:04,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319247624] [2020-11-29 20:42:04,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:04,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:04,787 INFO L87 Difference]: Start difference. First operand 1033 states and 1333 transitions. Second operand 4 states. [2020-11-29 20:42:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:05,001 INFO L93 Difference]: Finished difference Result 2381 states and 3087 transitions. [2020-11-29 20:42:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:05,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-11-29 20:42:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:05,014 INFO L225 Difference]: With dead ends: 2381 [2020-11-29 20:42:05,019 INFO L226 Difference]: Without dead ends: 1444 [2020-11-29 20:42:05,021 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-29 20:42:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-11-29 20:42:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 975. [2020-11-29 20:42:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2020-11-29 20:42:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1253 transitions. [2020-11-29 20:42:05,161 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1253 transitions. Word has length 80 [2020-11-29 20:42:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:05,161 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1253 transitions. [2020-11-29 20:42:05,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1253 transitions. [2020-11-29 20:42:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-29 20:42:05,163 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:05,163 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-29 20:42:05,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 20:42:05,163 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-29 20:42:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash -868242773, now seen corresponding path program 1 times [2020-11-29 20:42:05,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:05,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171095084] [2020-11-29 20:42:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:05,306 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-29 20:42:05,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171095084] [2020-11-29 20:42:05,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:05,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:05,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807335234] [2020-11-29 20:42:05,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:05,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:05,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:05,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:05,308 INFO L87 Difference]: Start difference. First operand 975 states and 1253 transitions. Second operand 6 states. [2020-11-29 20:42:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:05,907 INFO L93 Difference]: Finished difference Result 3200 states and 4277 transitions. [2020-11-29 20:42:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 20:42:05,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-11-29 20:42:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:05,925 INFO L225 Difference]: With dead ends: 3200 [2020-11-29 20:42:05,925 INFO L226 Difference]: Without dead ends: 2416 [2020-11-29 20:42:05,927 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-29 20:42:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2020-11-29 20:42:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 963. [2020-11-29 20:42:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-11-29 20:42:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1241 transitions. [2020-11-29 20:42:06,097 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1241 transitions. Word has length 82 [2020-11-29 20:42:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:06,098 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 1241 transitions. [2020-11-29 20:42:06,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1241 transitions. [2020-11-29 20:42:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-29 20:42:06,100 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:06,100 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-29 20:42:06,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 20:42:06,100 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-29 20:42:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash 528163420, now seen corresponding path program 1 times [2020-11-29 20:42:06,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:06,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515710624] [2020-11-29 20:42:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:06,205 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-29 20:42:06,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515710624] [2020-11-29 20:42:06,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:06,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:06,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416454305] [2020-11-29 20:42:06,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:06,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:06,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:06,207 INFO L87 Difference]: Start difference. First operand 963 states and 1241 transitions. Second operand 6 states. [2020-11-29 20:42:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:06,526 INFO L93 Difference]: Finished difference Result 2288 states and 3068 transitions. [2020-11-29 20:42:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:42:06,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-11-29 20:42:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:06,530 INFO L225 Difference]: With dead ends: 2288 [2020-11-29 20:42:06,531 INFO L226 Difference]: Without dead ends: 1504 [2020-11-29 20:42:06,533 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-29 20:42:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2020-11-29 20:42:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 969. [2020-11-29 20:42:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-11-29 20:42:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1247 transitions. [2020-11-29 20:42:06,687 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1247 transitions. Word has length 83 [2020-11-29 20:42:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:06,687 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1247 transitions. [2020-11-29 20:42:06,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1247 transitions. [2020-11-29 20:42:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-29 20:42:06,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:06,690 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, 1] [2020-11-29 20:42:06,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 20:42:06,691 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-29 20:42:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:06,692 INFO L82 PathProgramCache]: Analyzing trace with hash -953396613, now seen corresponding path program 1 times [2020-11-29 20:42:06,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:06,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678638790] [2020-11-29 20:42:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:06,904 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-29 20:42:06,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678638790] [2020-11-29 20:42:06,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45306941] [2020-11-29 20:42:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:07,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 20:42:07,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:07,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:42:09,066 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-29 20:42:09,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:09,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-29 20:42:09,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68389231] [2020-11-29 20:42:09,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 20:42:09,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:09,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 20:42:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:42:09,069 INFO L87 Difference]: Start difference. First operand 969 states and 1247 transitions. Second operand 12 states. [2020-11-29 20:42:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:11,254 INFO L93 Difference]: Finished difference Result 4203 states and 5524 transitions. [2020-11-29 20:42:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 20:42:11,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2020-11-29 20:42:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:11,261 INFO L225 Difference]: With dead ends: 4203 [2020-11-29 20:42:11,261 INFO L226 Difference]: Without dead ends: 3419 [2020-11-29 20:42:11,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2020-11-29 20:42:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2020-11-29 20:42:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 1365. [2020-11-29 20:42:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2020-11-29 20:42:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1774 transitions. [2020-11-29 20:42:11,567 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1774 transitions. Word has length 133 [2020-11-29 20:42:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:11,567 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 1774 transitions. [2020-11-29 20:42:11,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 20:42:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1774 transitions. [2020-11-29 20:42:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-29 20:42:11,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:11,571 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] [2020-11-29 20:42:11,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-29 20:42:11,784 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-29 20:42:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2082030467, now seen corresponding path program 1 times [2020-11-29 20:42:11,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:11,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040731269] [2020-11-29 20:42:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:12,062 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-29 20:42:12,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040731269] [2020-11-29 20:42:12,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027415110] [2020-11-29 20:42:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:12,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 20:42:12,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:12,396 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-29 20:42:12,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:42:12,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-11-29 20:42:12,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773519410] [2020-11-29 20:42:12,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:12,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:42:12,399 INFO L87 Difference]: Start difference. First operand 1365 states and 1774 transitions. Second operand 4 states. [2020-11-29 20:42:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:12,710 INFO L93 Difference]: Finished difference Result 2593 states and 3388 transitions. [2020-11-29 20:42:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:42:12,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-11-29 20:42:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:12,713 INFO L225 Difference]: With dead ends: 2593 [2020-11-29 20:42:12,714 INFO L226 Difference]: Without dead ends: 1316 [2020-11-29 20:42:12,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:42:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2020-11-29 20:42:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2020-11-29 20:42:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2020-11-29 20:42:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1703 transitions. [2020-11-29 20:42:12,904 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1703 transitions. Word has length 133 [2020-11-29 20:42:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:12,904 INFO L481 AbstractCegarLoop]: Abstraction has 1316 states and 1703 transitions. [2020-11-29 20:42:12,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1703 transitions. [2020-11-29 20:42:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-29 20:42:12,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:12,909 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, 1] [2020-11-29 20:42:13,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:13,136 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-29 20:42:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash 714786357, now seen corresponding path program 1 times [2020-11-29 20:42:13,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:13,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016959822] [2020-11-29 20:42:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:13,454 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-29 20:42:13,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016959822] [2020-11-29 20:42:13,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339952360] [2020-11-29 20:42:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:13,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:42:13,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:13,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:42:14,122 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-29 20:42:14,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:14,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-29 20:42:14,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918587935] [2020-11-29 20:42:14,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 20:42:14,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 20:42:14,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:42:14,125 INFO L87 Difference]: Start difference. First operand 1316 states and 1703 transitions. Second operand 16 states. [2020-11-29 20:42:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:16,804 INFO L93 Difference]: Finished difference Result 3938 states and 5156 transitions. [2020-11-29 20:42:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-29 20:42:16,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2020-11-29 20:42:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:16,810 INFO L225 Difference]: With dead ends: 3938 [2020-11-29 20:42:16,810 INFO L226 Difference]: Without dead ends: 2826 [2020-11-29 20:42:16,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2020-11-29 20:42:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2020-11-29 20:42:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1531. [2020-11-29 20:42:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2020-11-29 20:42:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1973 transitions. [2020-11-29 20:42:17,104 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1973 transitions. Word has length 133 [2020-11-29 20:42:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:17,105 INFO L481 AbstractCegarLoop]: Abstraction has 1531 states and 1973 transitions. [2020-11-29 20:42:17,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 20:42:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1973 transitions. [2020-11-29 20:42:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-29 20:42:17,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:17,107 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, 1] [2020-11-29 20:42:17,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:17,320 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-29 20:42:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:17,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1258379021, now seen corresponding path program 1 times [2020-11-29 20:42:17,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:17,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397677999] [2020-11-29 20:42:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:17,462 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-29 20:42:17,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397677999] [2020-11-29 20:42:17,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:17,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:17,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442761493] [2020-11-29 20:42:17,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:42:17,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:17,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:42:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:42:17,465 INFO L87 Difference]: Start difference. First operand 1531 states and 1973 transitions. Second operand 5 states. [2020-11-29 20:42:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:17,929 INFO L93 Difference]: Finished difference Result 2808 states and 3658 transitions. [2020-11-29 20:42:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:17,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-11-29 20:42:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:17,933 INFO L225 Difference]: With dead ends: 2808 [2020-11-29 20:42:17,933 INFO L226 Difference]: Without dead ends: 1425 [2020-11-29 20:42:17,935 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-29 20:42:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-11-29 20:42:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2020-11-29 20:42:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2020-11-29 20:42:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1844 transitions. [2020-11-29 20:42:18,157 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1844 transitions. Word has length 133 [2020-11-29 20:42:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:18,157 INFO L481 AbstractCegarLoop]: Abstraction has 1425 states and 1844 transitions. [2020-11-29 20:42:18,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:42:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1844 transitions. [2020-11-29 20:42:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:42:18,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:18,161 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] [2020-11-29 20:42:18,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 20:42:18,162 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-29 20:42:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash -240157227, now seen corresponding path program 1 times [2020-11-29 20:42:18,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:18,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24130093] [2020-11-29 20:42:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:18,441 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-29 20:42:18,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24130093] [2020-11-29 20:42:18,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712251053] [2020-11-29 20:42:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:18,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:42:18,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:18,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:42:18,956 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-29 20:42:18,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:18,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-11-29 20:42:18,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719953168] [2020-11-29 20:42:18,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 20:42:18,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 20:42:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:42:18,958 INFO L87 Difference]: Start difference. First operand 1425 states and 1844 transitions. Second operand 16 states. [2020-11-29 20:42:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:21,555 INFO L93 Difference]: Finished difference Result 4291 states and 5639 transitions. [2020-11-29 20:42:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-29 20:42:21,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 134 [2020-11-29 20:42:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:21,562 INFO L225 Difference]: With dead ends: 4291 [2020-11-29 20:42:21,563 INFO L226 Difference]: Without dead ends: 3090 [2020-11-29 20:42:21,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2020-11-29 20:42:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2020-11-29 20:42:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1684. [2020-11-29 20:42:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-11-29 20:42:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2170 transitions. [2020-11-29 20:42:21,902 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2170 transitions. Word has length 134 [2020-11-29 20:42:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:21,902 INFO L481 AbstractCegarLoop]: Abstraction has 1684 states and 2170 transitions. [2020-11-29 20:42:21,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 20:42:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2170 transitions. [2020-11-29 20:42:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:42:21,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:21,906 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, 1] [2020-11-29 20:42:22,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:22,120 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-29 20:42:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2129602969, now seen corresponding path program 1 times [2020-11-29 20:42:22,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:22,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002516922] [2020-11-29 20:42:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:22,394 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-29 20:42:22,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002516922] [2020-11-29 20:42:22,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:22,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 20:42:22,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669996094] [2020-11-29 20:42:22,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 20:42:22,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 20:42:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-29 20:42:22,397 INFO L87 Difference]: Start difference. First operand 1684 states and 2170 transitions. Second operand 10 states. [2020-11-29 20:42:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:23,524 INFO L93 Difference]: Finished difference Result 4207 states and 5473 transitions. [2020-11-29 20:42:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 20:42:23,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2020-11-29 20:42:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:23,531 INFO L225 Difference]: With dead ends: 4207 [2020-11-29 20:42:23,531 INFO L226 Difference]: Without dead ends: 2808 [2020-11-29 20:42:23,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2020-11-29 20:42:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2020-11-29 20:42:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1912. [2020-11-29 20:42:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2020-11-29 20:42:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2455 transitions. [2020-11-29 20:42:23,889 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2455 transitions. Word has length 134 [2020-11-29 20:42:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:23,889 INFO L481 AbstractCegarLoop]: Abstraction has 1912 states and 2455 transitions. [2020-11-29 20:42:23,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 20:42:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2455 transitions. [2020-11-29 20:42:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:42:23,892 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:23,892 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, 1] [2020-11-29 20:42:23,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 20:42:23,892 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-29 20:42:23,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash -232106203, now seen corresponding path program 1 times [2020-11-29 20:42:23,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:23,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092813225] [2020-11-29 20:42:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:24,120 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-29 20:42:24,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092813225] [2020-11-29 20:42:24,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:24,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:24,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463466571] [2020-11-29 20:42:24,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:42:24,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:42:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:42:24,125 INFO L87 Difference]: Start difference. First operand 1912 states and 2455 transitions. Second operand 5 states. [2020-11-29 20:42:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:24,676 INFO L93 Difference]: Finished difference Result 3451 states and 4490 transitions. [2020-11-29 20:42:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:42:24,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2020-11-29 20:42:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:24,681 INFO L225 Difference]: With dead ends: 3451 [2020-11-29 20:42:24,681 INFO L226 Difference]: Without dead ends: 1775 [2020-11-29 20:42:24,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:42:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2020-11-29 20:42:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2020-11-29 20:42:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2020-11-29 20:42:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2284 transitions. [2020-11-29 20:42:25,022 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2284 transitions. Word has length 134 [2020-11-29 20:42:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:25,022 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2284 transitions. [2020-11-29 20:42:25,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:42:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2284 transitions. [2020-11-29 20:42:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 20:42:25,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:25,026 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] [2020-11-29 20:42:25,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 20:42:25,027 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-29 20:42:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1912949591, now seen corresponding path program 1 times [2020-11-29 20:42:25,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:25,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329694151] [2020-11-29 20:42:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:25,088 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-29 20:42:25,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329694151] [2020-11-29 20:42:25,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:25,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:25,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280822442] [2020-11-29 20:42:25,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:25,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:25,090 INFO L87 Difference]: Start difference. First operand 1775 states and 2284 transitions. Second operand 4 states. [2020-11-29 20:42:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:25,525 INFO L93 Difference]: Finished difference Result 3203 states and 4160 transitions. [2020-11-29 20:42:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:42:25,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-11-29 20:42:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:25,529 INFO L225 Difference]: With dead ends: 3203 [2020-11-29 20:42:25,529 INFO L226 Difference]: Without dead ends: 1576 [2020-11-29 20:42:25,531 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-29 20:42:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2020-11-29 20:42:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1571. [2020-11-29 20:42:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-11-29 20:42:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2022 transitions. [2020-11-29 20:42:25,815 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2022 transitions. Word has length 134 [2020-11-29 20:42:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:25,815 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 2022 transitions. [2020-11-29 20:42:25,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2022 transitions. [2020-11-29 20:42:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-29 20:42:25,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:25,819 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, 1] [2020-11-29 20:42:25,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 20:42:25,820 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-29 20:42:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -394488639, now seen corresponding path program 1 times [2020-11-29 20:42:25,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:25,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465127933] [2020-11-29 20:42:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:25,979 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-29 20:42:25,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465127933] [2020-11-29 20:42:25,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:25,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:25,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460609934] [2020-11-29 20:42:25,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:25,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:25,982 INFO L87 Difference]: Start difference. First operand 1571 states and 2022 transitions. Second operand 6 states. [2020-11-29 20:42:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:27,688 INFO L93 Difference]: Finished difference Result 8054 states and 10587 transitions. [2020-11-29 20:42:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 20:42:27,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2020-11-29 20:42:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:27,702 INFO L225 Difference]: With dead ends: 8054 [2020-11-29 20:42:27,703 INFO L226 Difference]: Without dead ends: 6707 [2020-11-29 20:42:27,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:42:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2020-11-29 20:42:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 2052. [2020-11-29 20:42:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2020-11-29 20:42:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2592 transitions. [2020-11-29 20:42:28,143 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2592 transitions. Word has length 135 [2020-11-29 20:42:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:28,143 INFO L481 AbstractCegarLoop]: Abstraction has 2052 states and 2592 transitions. [2020-11-29 20:42:28,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2592 transitions. [2020-11-29 20:42:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-29 20:42:28,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:28,148 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-29 20:42:28,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 20:42:28,148 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-29 20:42:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1778086883, now seen corresponding path program 1 times [2020-11-29 20:42:28,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:28,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011775374] [2020-11-29 20:42:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:28,377 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-29 20:42:28,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011775374] [2020-11-29 20:42:28,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047985543] [2020-11-29 20:42:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:28,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-29 20:42:28,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:28,833 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-29 20:42:28,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:28,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-29 20:42:28,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015188309] [2020-11-29 20:42:28,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 20:42:28,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 20:42:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-29 20:42:28,835 INFO L87 Difference]: Start difference. First operand 2052 states and 2592 transitions. Second operand 16 states. [2020-11-29 20:42:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:31,097 INFO L93 Difference]: Finished difference Result 7487 states and 9524 transitions. [2020-11-29 20:42:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-29 20:42:31,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 135 [2020-11-29 20:42:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:31,104 INFO L225 Difference]: With dead ends: 7487 [2020-11-29 20:42:31,104 INFO L226 Difference]: Without dead ends: 5659 [2020-11-29 20:42:31,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 137 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-29 20:42:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2020-11-29 20:42:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 2611. [2020-11-29 20:42:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2020-11-29 20:42:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3304 transitions. [2020-11-29 20:42:31,715 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3304 transitions. Word has length 135 [2020-11-29 20:42:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:31,715 INFO L481 AbstractCegarLoop]: Abstraction has 2611 states and 3304 transitions. [2020-11-29 20:42:31,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 20:42:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3304 transitions. [2020-11-29 20:42:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-29 20:42:31,721 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:31,722 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] [2020-11-29 20:42:31,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-29 20:42:31,948 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-29 20:42:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1485839515, now seen corresponding path program 1 times [2020-11-29 20:42:31,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:31,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408606567] [2020-11-29 20:42:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:32,024 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-29 20:42:32,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408606567] [2020-11-29 20:42:32,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:32,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:42:32,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080728544] [2020-11-29 20:42:32,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:42:32,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:42:32,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:42:32,027 INFO L87 Difference]: Start difference. First operand 2611 states and 3304 transitions. Second operand 4 states. [2020-11-29 20:42:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:32,567 INFO L93 Difference]: Finished difference Result 4794 states and 6109 transitions. [2020-11-29 20:42:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:42:32,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-11-29 20:42:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:32,571 INFO L225 Difference]: With dead ends: 4794 [2020-11-29 20:42:32,571 INFO L226 Difference]: Without dead ends: 2360 [2020-11-29 20:42:32,574 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-29 20:42:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2020-11-29 20:42:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2352. [2020-11-29 20:42:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2020-11-29 20:42:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2971 transitions. [2020-11-29 20:42:32,992 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2971 transitions. Word has length 135 [2020-11-29 20:42:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:32,992 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 2971 transitions. [2020-11-29 20:42:32,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:42:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2971 transitions. [2020-11-29 20:42:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-29 20:42:32,995 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:32,996 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] [2020-11-29 20:42:32,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 20:42:32,996 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-29 20:42:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash -701730720, now seen corresponding path program 1 times [2020-11-29 20:42:32,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:32,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822787537] [2020-11-29 20:42:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:33,239 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-29 20:42:33,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822787537] [2020-11-29 20:42:33,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183482813] [2020-11-29 20:42:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:33,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:42:33,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:33,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:42:33,627 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-29 20:42:33,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:33,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-11-29 20:42:33,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579935811] [2020-11-29 20:42:33,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:42:33,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:42:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:42:33,629 INFO L87 Difference]: Start difference. First operand 2352 states and 2971 transitions. Second operand 15 states. [2020-11-29 20:42:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:35,411 INFO L93 Difference]: Finished difference Result 6338 states and 8056 transitions. [2020-11-29 20:42:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 20:42:35,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2020-11-29 20:42:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:35,414 INFO L225 Difference]: With dead ends: 6338 [2020-11-29 20:42:35,414 INFO L226 Difference]: Without dead ends: 4210 [2020-11-29 20:42:35,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 130 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-29 20:42:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2020-11-29 20:42:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 2428. [2020-11-29 20:42:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2020-11-29 20:42:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3078 transitions. [2020-11-29 20:42:35,885 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3078 transitions. Word has length 136 [2020-11-29 20:42:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:35,886 INFO L481 AbstractCegarLoop]: Abstraction has 2428 states and 3078 transitions. [2020-11-29 20:42:35,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:42:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3078 transitions. [2020-11-29 20:42:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-29 20:42:35,890 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:35,891 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, 1] [2020-11-29 20:42:36,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-11-29 20:42:36,116 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-29 20:42:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash 57866394, now seen corresponding path program 1 times [2020-11-29 20:42:36,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:36,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081179003] [2020-11-29 20:42:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:36,332 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-29 20:42:36,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081179003] [2020-11-29 20:42:36,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133658742] [2020-11-29 20:42:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:36,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 20:42:36,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:36,723 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-29 20:42:36,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:36,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-29 20:42:36,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786968709] [2020-11-29 20:42:36,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 20:42:36,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 20:42:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 20:42:36,725 INFO L87 Difference]: Start difference. First operand 2428 states and 3078 transitions. Second operand 7 states. [2020-11-29 20:42:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:39,465 INFO L93 Difference]: Finished difference Result 12592 states and 16326 transitions. [2020-11-29 20:42:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 20:42:39,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-11-29 20:42:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:39,474 INFO L225 Difference]: With dead ends: 12592 [2020-11-29 20:42:39,474 INFO L226 Difference]: Without dead ends: 10388 [2020-11-29 20:42:39,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 146 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-29 20:42:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10388 states. [2020-11-29 20:42:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10388 to 3220. [2020-11-29 20:42:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2020-11-29 20:42:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4097 transitions. [2020-11-29 20:42:40,194 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4097 transitions. Word has length 136 [2020-11-29 20:42:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:40,194 INFO L481 AbstractCegarLoop]: Abstraction has 3220 states and 4097 transitions. [2020-11-29 20:42:40,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 20:42:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4097 transitions. [2020-11-29 20:42:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-29 20:42:40,197 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:40,198 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-29 20:42:40,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:40,398 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-29 20:42:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2128912830, now seen corresponding path program 1 times [2020-11-29 20:42:40,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:40,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835473351] [2020-11-29 20:42:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:40,603 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-29 20:42:40,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835473351] [2020-11-29 20:42:40,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227881280] [2020-11-29 20:42:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:40,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:42:40,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:41,001 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-29 20:42:41,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:42:41,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-29 20:42:41,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527157810] [2020-11-29 20:42:41,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:42:41,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:42:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:42:41,003 INFO L87 Difference]: Start difference. First operand 3220 states and 4097 transitions. Second operand 8 states. [2020-11-29 20:42:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:42,842 INFO L93 Difference]: Finished difference Result 8014 states and 10249 transitions. [2020-11-29 20:42:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 20:42:42,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-11-29 20:42:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:42,846 INFO L225 Difference]: With dead ends: 8014 [2020-11-29 20:42:42,846 INFO L226 Difference]: Without dead ends: 5018 [2020-11-29 20:42:42,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 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-29 20:42:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2020-11-29 20:42:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 3326. [2020-11-29 20:42:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2020-11-29 20:42:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4236 transitions. [2020-11-29 20:42:43,522 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4236 transitions. Word has length 136 [2020-11-29 20:42:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:43,522 INFO L481 AbstractCegarLoop]: Abstraction has 3326 states and 4236 transitions. [2020-11-29 20:42:43,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:42:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4236 transitions. [2020-11-29 20:42:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 20:42:43,525 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:43,525 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, 1] [2020-11-29 20:42:43,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-11-29 20:42:43,726 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-29 20:42:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1363951242, now seen corresponding path program 1 times [2020-11-29 20:42:43,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:43,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577332427] [2020-11-29 20:42:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:43,975 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-29 20:42:43,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577332427] [2020-11-29 20:42:43,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048011341] [2020-11-29 20:42:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:44,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 20:42:44,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:44,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:42:44,518 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-29 20:42:44,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 20:42:44,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-11-29 20:42:44,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32363125] [2020-11-29 20:42:44,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 20:42:44,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 20:42:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-29 20:42:44,520 INFO L87 Difference]: Start difference. First operand 3326 states and 4236 transitions. Second operand 15 states. [2020-11-29 20:42:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:47,193 INFO L93 Difference]: Finished difference Result 8301 states and 10583 transitions. [2020-11-29 20:42:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 20:42:47,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2020-11-29 20:42:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:47,199 INFO L225 Difference]: With dead ends: 8301 [2020-11-29 20:42:47,199 INFO L226 Difference]: Without dead ends: 5199 [2020-11-29 20:42:47,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 20:42:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2020-11-29 20:42:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 3364. [2020-11-29 20:42:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2020-11-29 20:42:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4284 transitions. [2020-11-29 20:42:47,775 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4284 transitions. Word has length 137 [2020-11-29 20:42:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:47,775 INFO L481 AbstractCegarLoop]: Abstraction has 3364 states and 4284 transitions. [2020-11-29 20:42:47,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 20:42:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4284 transitions. [2020-11-29 20:42:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 20:42:47,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:47,779 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, 1] [2020-11-29 20:42:47,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:47,979 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-29 20:42:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1734761688, now seen corresponding path program 1 times [2020-11-29 20:42:47,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:47,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586418970] [2020-11-29 20:42:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:48,180 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-29 20:42:48,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586418970] [2020-11-29 20:42:48,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27850244] [2020-11-29 20:42:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:48,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:42:48,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:48,503 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-29 20:42:48,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:42:48,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-29 20:42:48,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356033897] [2020-11-29 20:42:48,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:42:48,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:42:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:42:48,505 INFO L87 Difference]: Start difference. First operand 3364 states and 4284 transitions. Second operand 8 states. [2020-11-29 20:42:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:50,151 INFO L93 Difference]: Finished difference Result 8924 states and 11431 transitions. [2020-11-29 20:42:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 20:42:50,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2020-11-29 20:42:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:50,156 INFO L225 Difference]: With dead ends: 8924 [2020-11-29 20:42:50,156 INFO L226 Difference]: Without dead ends: 5784 [2020-11-29 20:42:50,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 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-29 20:42:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2020-11-29 20:42:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 3643. [2020-11-29 20:42:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2020-11-29 20:42:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4644 transitions. [2020-11-29 20:42:50,863 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4644 transitions. Word has length 137 [2020-11-29 20:42:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:50,863 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 4644 transitions. [2020-11-29 20:42:50,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:42:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4644 transitions. [2020-11-29 20:42:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 20:42:50,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:50,866 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, 1] [2020-11-29 20:42:51,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 20:42:51,067 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-29 20:42:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1145607294, now seen corresponding path program 1 times [2020-11-29 20:42:51,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:51,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516108645] [2020-11-29 20:42:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:51,263 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-29 20:42:51,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516108645] [2020-11-29 20:42:51,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243774461] [2020-11-29 20:42:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/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-29 20:42:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:51,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 20:42:51,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 20:42:51,602 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-29 20:42:51,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 20:42:51,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-11-29 20:42:51,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903849565] [2020-11-29 20:42:51,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 20:42:51,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 20:42:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 20:42:51,604 INFO L87 Difference]: Start difference. First operand 3643 states and 4644 transitions. Second operand 8 states. [2020-11-29 20:42:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:53,155 INFO L93 Difference]: Finished difference Result 8572 states and 10955 transitions. [2020-11-29 20:42:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 20:42:53,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2020-11-29 20:42:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:53,160 INFO L225 Difference]: With dead ends: 8572 [2020-11-29 20:42:53,160 INFO L226 Difference]: Without dead ends: 5153 [2020-11-29 20:42:53,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 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-29 20:42:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2020-11-29 20:42:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 3361. [2020-11-29 20:42:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-11-29 20:42:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4274 transitions. [2020-11-29 20:42:53,775 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4274 transitions. Word has length 137 [2020-11-29 20:42:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:53,775 INFO L481 AbstractCegarLoop]: Abstraction has 3361 states and 4274 transitions. [2020-11-29 20:42:53,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 20:42:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4274 transitions. [2020-11-29 20:42:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-29 20:42:53,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:53,778 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] [2020-11-29 20:42:53,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-11-29 20:42:53,978 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-29 20:42:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 184921083, now seen corresponding path program 1 times [2020-11-29 20:42:53,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:53,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247582951] [2020-11-29 20:42:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:42:54,154 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-29 20:42:54,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247582951] [2020-11-29 20:42:54,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:42:54,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 20:42:54,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437572161] [2020-11-29 20:42:54,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:42:54,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:42:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:42:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:42:54,156 INFO L87 Difference]: Start difference. First operand 3361 states and 4274 transitions. Second operand 6 states. [2020-11-29 20:42:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:42:55,382 INFO L93 Difference]: Finished difference Result 8605 states and 11109 transitions. [2020-11-29 20:42:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 20:42:55,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2020-11-29 20:42:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:42:55,387 INFO L225 Difference]: With dead ends: 8605 [2020-11-29 20:42:55,387 INFO L226 Difference]: Without dead ends: 5450 [2020-11-29 20:42:55,390 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-29 20:42:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2020-11-29 20:42:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 3361. [2020-11-29 20:42:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-11-29 20:42:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4271 transitions. [2020-11-29 20:42:56,040 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4271 transitions. Word has length 138 [2020-11-29 20:42:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:42:56,040 INFO L481 AbstractCegarLoop]: Abstraction has 3361 states and 4271 transitions. [2020-11-29 20:42:56,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:42:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4271 transitions. [2020-11-29 20:42:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-29 20:42:56,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:42:56,042 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, 1] [2020-11-29 20:42:56,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 20:42:56,043 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-29 20:42:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:42:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 583046840, now seen corresponding path program 1 times [2020-11-29 20:42:56,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:42:56,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494103118] [2020-11-29 20:42:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:42:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:42:56,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:42:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:42:56,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:42:56,264 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:42:56,265 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 20:42:56,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-29 20:42:56,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:42:56 BoogieIcfgContainer [2020-11-29 20:42:56,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:42:56,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:42:56,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:42:56,638 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:42:56,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:41:54" (3/4) ... [2020-11-29 20:42:56,640 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 20:42:56,957 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9d6808ab-3dbf-4911-8525-32ed471b3fd4/bin/uautomizer/witness.graphml [2020-11-29 20:42:56,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:42:56,959 INFO L168 Benchmark]: Toolchain (without parser) took 65410.62 ms. Allocated memory was 88.1 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 51.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 76.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,960 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 88.1 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:42:56,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.56 ms. Allocated memory is still 88.1 MB. Free memory was 51.2 MB in the beginning and 58.2 MB in the end (delta: -6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.62 ms. Allocated memory is still 88.1 MB. Free memory was 58.2 MB in the beginning and 53.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,961 INFO L168 Benchmark]: Boogie Preprocessor took 85.72 ms. Allocated memory is still 88.1 MB. Free memory was 53.3 MB in the beginning and 49.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,961 INFO L168 Benchmark]: RCFGBuilder took 1790.19 ms. Allocated memory was 88.1 MB in the beginning and 121.6 MB in the end (delta: 33.6 MB). Free memory was 49.5 MB in the beginning and 86.6 MB in the end (delta: -37.1 MB). Peak memory consumption was 49.6 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,962 INFO L168 Benchmark]: TraceAbstraction took 62533.34 ms. Allocated memory was 121.6 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 85.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 901.8 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,962 INFO L168 Benchmark]: Witness Printer took 320.26 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.9 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:42:56,965 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.29 ms. Allocated memory is still 88.1 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 570.56 ms. Allocated memory is still 88.1 MB. Free memory was 51.2 MB in the beginning and 58.2 MB in the end (delta: -6.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 101.62 ms. Allocated memory is still 88.1 MB. Free memory was 58.2 MB in the beginning and 53.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.72 ms. Allocated memory is still 88.1 MB. Free memory was 53.3 MB in the beginning and 49.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1790.19 ms. Allocated memory was 88.1 MB in the beginning and 121.6 MB in the end (delta: 33.6 MB). Free memory was 49.5 MB in the beginning and 86.6 MB in the end (delta: -37.1 MB). Peak memory consumption was 49.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 62533.34 ms. Allocated memory was 121.6 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 85.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 901.8 MB. Max. memory is 16.1 GB. * Witness Printer took 320.26 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.9 MB). Peak memory consumption was 46.1 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 i2 < 10 [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=6, 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=6, 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=6, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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() [L609] 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, 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 i2 < 10 [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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=6, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=6, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=6, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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() [L609] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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.BOUNDED-10.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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=6, 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, 318 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 62.0s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22306 SDtfs, 35262 SDslu, 73006 SDs, 0 SdLazy, 12277 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2030 GetRequests, 1555 SyntacticMatches, 15 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3643occurred 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: 10.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 44178 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 5934 NumberOfCodeBlocks, 5934 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5735 ConstructedInterpolants, 77 QuantifiedInterpolants, 3507412 SizeOfPredicates, 44 NumberOfNonLiveVariables, 8734 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...