./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 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-69874e2 [2020-12-01 15:24:00,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:24:00,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:24:00,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:24:00,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:24:00,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:24:00,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:24:00,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:24:00,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:24:00,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:24:00,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:24:00,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:24:00,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:24:00,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:24:00,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:24:00,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:24:00,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:24:00,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:24:00,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:24:00,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:24:00,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:24:00,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:24:00,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:24:00,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:24:00,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:24:00,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:24:00,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:24:00,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:24:00,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:24:00,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:24:00,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:24:00,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:24:00,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:24:00,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:24:00,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:24:00,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:24:00,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:24:00,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:24:00,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:24:00,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:24:00,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:24:00,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:24:00,493 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:24:00,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:24:00,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:24:00,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:24:00,495 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:24:00,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:24:00,496 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:24:00,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:24:00,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:24:00,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:24:00,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:24:00,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:24:00,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:24:00,498 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:24:00,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:24:00,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:24:00,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:24:00,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:24:00,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:24:00,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:24:00,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:24:00,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:24:00,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:24:00,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:24:00,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:24:00,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:24:00,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:24:00,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:24:00,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:24:00,502 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_1e7c6783-a771-4142-81a4-c772682180c1/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_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:00,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:24:00,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:24:00,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:24:00,827 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:24:00,830 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:24:00,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-12-01 15:24:00,944 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/data/c06e76ff2/e23d9388995845aca2da7643739a655b/FLAGef8dc65f8 [2020-12-01 15:24:01,555 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:24:01,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-12-01 15:24:01,570 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/data/c06e76ff2/e23d9388995845aca2da7643739a655b/FLAGef8dc65f8 [2020-12-01 15:24:01,833 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/data/c06e76ff2/e23d9388995845aca2da7643739a655b [2020-12-01 15:24:01,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:24:01,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:24:01,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:24:01,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:24:01,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:24:01,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:24:01" (1/1) ... [2020-12-01 15:24:01,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc96f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:01, skipping insertion in model container [2020-12-01 15:24:01,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:24:01" (1/1) ... [2020-12-01 15:24:01,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:24:01,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:24:02,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:24:02,412 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:24:02,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:24:02,562 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:24:02,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02 WrapperNode [2020-12-01 15:24:02,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:24:02,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:24:02,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:24:02,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:24:02,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:24:02,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:24:02,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:24:02,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:24:02,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... [2020-12-01 15:24:02,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:24:02,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:24:02,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:24:02,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:24:02,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:02,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:24:02,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:24:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:24:02,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:24:04,659 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:24:04,659 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-12-01 15:24:04,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:24:04 BoogieIcfgContainer [2020-12-01 15:24:04,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:24:04,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:24:04,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:24:04,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:24:04,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:24:01" (1/3) ... [2020-12-01 15:24:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183b77ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:24:04, skipping insertion in model container [2020-12-01 15:24:04,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:24:02" (2/3) ... [2020-12-01 15:24:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183b77ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:24:04, skipping insertion in model container [2020-12-01 15:24:04,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:24:04" (3/3) ... [2020-12-01 15:24:04,676 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2020-12-01 15:24:04,692 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:24:04,697 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-01 15:24:04,707 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-01 15:24:04,752 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:24:04,753 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:24:04,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:24:04,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:24:04,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:24:04,753 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:24:04,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:24:04,754 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:24:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states. [2020-12-01 15:24:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 15:24:04,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:04,793 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-12-01 15:24:04,794 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-12-01 15:24:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-12-01 15:24:04,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:04,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062484309] [2020-12-01 15:24:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:05,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062484309] [2020-12-01 15:24:05,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:05,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:24:05,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890541345] [2020-12-01 15:24:05,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-01 15:24:05,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-01 15:24:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-01 15:24:05,140 INFO L87 Difference]: Start difference. First operand 318 states. Second operand 2 states. [2020-12-01 15:24:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:05,237 INFO L93 Difference]: Finished difference Result 597 states and 916 transitions. [2020-12-01 15:24:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-01 15:24:05,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-12-01 15:24:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:05,256 INFO L225 Difference]: With dead ends: 597 [2020-12-01 15:24:05,256 INFO L226 Difference]: Without dead ends: 291 [2020-12-01 15:24:05,262 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-12-01 15:24:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-01 15:24:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-12-01 15:24:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-01 15:24:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2020-12-01 15:24:05,362 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 33 [2020-12-01 15:24:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:05,362 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2020-12-01 15:24:05,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-01 15:24:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2020-12-01 15:24:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 15:24:05,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:05,369 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-12-01 15:24:05,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:24:05,370 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-12-01 15:24:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-12-01 15:24:05,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:05,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366649820] [2020-12-01 15:24:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:05,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366649820] [2020-12-01 15:24:05,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:05,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:05,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588206385] [2020-12-01 15:24:05,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:05,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:05,588 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2020-12-01 15:24:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:05,668 INFO L93 Difference]: Finished difference Result 568 states and 824 transitions. [2020-12-01 15:24:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:24:05,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-01 15:24:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:05,678 INFO L225 Difference]: With dead ends: 568 [2020-12-01 15:24:05,678 INFO L226 Difference]: Without dead ends: 291 [2020-12-01 15:24:05,683 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-12-01 15:24:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-01 15:24:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2020-12-01 15:24:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-01 15:24:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2020-12-01 15:24:05,715 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 33 [2020-12-01 15:24:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:05,716 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2020-12-01 15:24:05,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2020-12-01 15:24:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-01 15:24:05,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:05,720 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-12-01 15:24:05,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:24:05,722 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-12-01 15:24:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-12-01 15:24:05,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:05,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242345298] [2020-12-01 15:24:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:05,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242345298] [2020-12-01 15:24:05,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:05,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:05,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094507566] [2020-12-01 15:24:05,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:05,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:05,952 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand 3 states. [2020-12-01 15:24:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:06,050 INFO L93 Difference]: Finished difference Result 599 states and 859 transitions. [2020-12-01 15:24:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:06,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-01 15:24:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:06,056 INFO L225 Difference]: With dead ends: 599 [2020-12-01 15:24:06,056 INFO L226 Difference]: Without dead ends: 325 [2020-12-01 15:24:06,057 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-12-01 15:24:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-01 15:24:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 267. [2020-12-01 15:24:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-12-01 15:24:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2020-12-01 15:24:06,098 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 44 [2020-12-01 15:24:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:06,098 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2020-12-01 15:24:06,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2020-12-01 15:24:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-01 15:24:06,101 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:06,101 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-12-01 15:24:06,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:24:06,101 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-12-01 15:24:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-12-01 15:24:06,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:06,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90020573] [2020-12-01 15:24:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:06,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90020573] [2020-12-01 15:24:06,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:06,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:06,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169590195] [2020-12-01 15:24:06,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:06,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:06,324 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand 3 states. [2020-12-01 15:24:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:06,376 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2020-12-01 15:24:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:06,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-01 15:24:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:06,381 INFO L225 Difference]: With dead ends: 744 [2020-12-01 15:24:06,382 INFO L226 Difference]: Without dead ends: 494 [2020-12-01 15:24:06,383 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-12-01 15:24:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-12-01 15:24:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 300. [2020-12-01 15:24:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-01 15:24:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2020-12-01 15:24:06,409 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 53 [2020-12-01 15:24:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:06,411 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2020-12-01 15:24:06,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2020-12-01 15:24:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-01 15:24:06,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:06,422 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-12-01 15:24:06,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:24:06,423 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-12-01 15:24:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1464669016, now seen corresponding path program 1 times [2020-12-01 15:24:06,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:06,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13724789] [2020-12-01 15:24:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:06,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13724789] [2020-12-01 15:24:06,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:06,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:06,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199287569] [2020-12-01 15:24:06,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:06,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:06,563 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand 3 states. [2020-12-01 15:24:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:06,622 INFO L93 Difference]: Finished difference Result 822 states and 1175 transitions. [2020-12-01 15:24:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:06,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-01 15:24:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:06,628 INFO L225 Difference]: With dead ends: 822 [2020-12-01 15:24:06,628 INFO L226 Difference]: Without dead ends: 539 [2020-12-01 15:24:06,629 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-12-01 15:24:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-12-01 15:24:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 321. [2020-12-01 15:24:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-12-01 15:24:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2020-12-01 15:24:06,651 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 54 [2020-12-01 15:24:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:06,652 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2020-12-01 15:24:06,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2020-12-01 15:24:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-01 15:24:06,656 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:06,657 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-12-01 15:24:06,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:24:06,657 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-12-01 15:24:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -784610646, now seen corresponding path program 1 times [2020-12-01 15:24:06,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:06,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789989041] [2020-12-01 15:24:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:06,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789989041] [2020-12-01 15:24:06,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:06,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:06,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489307253] [2020-12-01 15:24:06,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:24:06,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:24:06,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:24:06,817 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand 5 states. [2020-12-01 15:24:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:07,131 INFO L93 Difference]: Finished difference Result 1003 states and 1436 transitions. [2020-12-01 15:24:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:24:07,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-01 15:24:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:07,142 INFO L225 Difference]: With dead ends: 1003 [2020-12-01 15:24:07,143 INFO L226 Difference]: Without dead ends: 699 [2020-12-01 15:24:07,144 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-12-01 15:24:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-12-01 15:24:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-12-01 15:24:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-12-01 15:24:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 592 transitions. [2020-12-01 15:24:07,172 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 592 transitions. Word has length 54 [2020-12-01 15:24:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:07,177 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 592 transitions. [2020-12-01 15:24:07,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:24:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 592 transitions. [2020-12-01 15:24:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-01 15:24:07,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:07,179 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-12-01 15:24:07,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:24:07,179 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-12-01 15:24:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1195121816, now seen corresponding path program 1 times [2020-12-01 15:24:07,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:07,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434617248] [2020-12-01 15:24:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:07,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434617248] [2020-12-01 15:24:07,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:07,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:07,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431890262] [2020-12-01 15:24:07,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:24:07,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:24:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:24:07,318 INFO L87 Difference]: Start difference. First operand 419 states and 592 transitions. Second operand 5 states. [2020-12-01 15:24:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:07,600 INFO L93 Difference]: Finished difference Result 1003 states and 1428 transitions. [2020-12-01 15:24:07,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:24:07,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-01 15:24:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:07,606 INFO L225 Difference]: With dead ends: 1003 [2020-12-01 15:24:07,607 INFO L226 Difference]: Without dead ends: 699 [2020-12-01 15:24:07,608 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-12-01 15:24:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-12-01 15:24:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2020-12-01 15:24:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-12-01 15:24:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2020-12-01 15:24:07,637 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 55 [2020-12-01 15:24:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:07,638 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2020-12-01 15:24:07,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:24:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2020-12-01 15:24:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-01 15:24:07,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:07,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:24:07,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:24:07,641 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-12-01 15:24:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-12-01 15:24:07,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:07,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254410151] [2020-12-01 15:24:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:07,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254410151] [2020-12-01 15:24:07,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:07,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:07,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517868421] [2020-12-01 15:24:07,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:07,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:07,776 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2020-12-01 15:24:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:07,832 INFO L93 Difference]: Finished difference Result 843 states and 1199 transitions. [2020-12-01 15:24:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:07,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-01 15:24:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:07,838 INFO L225 Difference]: With dead ends: 843 [2020-12-01 15:24:07,838 INFO L226 Difference]: Without dead ends: 539 [2020-12-01 15:24:07,839 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-12-01 15:24:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-12-01 15:24:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 414. [2020-12-01 15:24:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-12-01 15:24:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 580 transitions. [2020-12-01 15:24:07,867 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 580 transitions. Word has length 56 [2020-12-01 15:24:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:07,869 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 580 transitions. [2020-12-01 15:24:07,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 580 transitions. [2020-12-01 15:24:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-01 15:24:07,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:07,871 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-12-01 15:24:07,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:24:07,871 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-12-01 15:24:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash 819502993, now seen corresponding path program 1 times [2020-12-01 15:24:07,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:07,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069050530] [2020-12-01 15:24:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:07,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069050530] [2020-12-01 15:24:07,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:07,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:07,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290935781] [2020-12-01 15:24:07,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:08,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:08,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:08,005 INFO L87 Difference]: Start difference. First operand 414 states and 580 transitions. Second operand 3 states. [2020-12-01 15:24:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:08,106 INFO L93 Difference]: Finished difference Result 842 states and 1198 transitions. [2020-12-01 15:24:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:08,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-01 15:24:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:08,110 INFO L225 Difference]: With dead ends: 842 [2020-12-01 15:24:08,111 INFO L226 Difference]: Without dead ends: 543 [2020-12-01 15:24:08,112 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-12-01 15:24:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-12-01 15:24:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 394. [2020-12-01 15:24:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-12-01 15:24:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2020-12-01 15:24:08,135 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 60 [2020-12-01 15:24:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:08,135 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2020-12-01 15:24:08,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2020-12-01 15:24:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-01 15:24:08,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:08,137 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-12-01 15:24:08,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:24:08,137 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-12-01 15:24:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash -69192917, now seen corresponding path program 1 times [2020-12-01 15:24:08,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:08,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970718619] [2020-12-01 15:24:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:08,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970718619] [2020-12-01 15:24:08,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:08,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:08,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644888191] [2020-12-01 15:24:08,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:08,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:08,212 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand 3 states. [2020-12-01 15:24:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:08,293 INFO L93 Difference]: Finished difference Result 810 states and 1142 transitions. [2020-12-01 15:24:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:08,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-01 15:24:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:08,303 INFO L225 Difference]: With dead ends: 810 [2020-12-01 15:24:08,303 INFO L226 Difference]: Without dead ends: 531 [2020-12-01 15:24:08,305 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-12-01 15:24:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-12-01 15:24:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2020-12-01 15:24:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-12-01 15:24:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 530 transitions. [2020-12-01 15:24:08,330 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 530 transitions. Word has length 64 [2020-12-01 15:24:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:08,330 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 530 transitions. [2020-12-01 15:24:08,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 530 transitions. [2020-12-01 15:24:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-01 15:24:08,332 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:08,332 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-12-01 15:24:08,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:24:08,333 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-12-01 15:24:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1588224041, now seen corresponding path program 1 times [2020-12-01 15:24:08,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:08,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833367338] [2020-12-01 15:24:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:08,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833367338] [2020-12-01 15:24:08,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:08,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:08,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97008256] [2020-12-01 15:24:08,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:08,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:08,451 INFO L87 Difference]: Start difference. First operand 382 states and 530 transitions. Second operand 6 states. [2020-12-01 15:24:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:08,661 INFO L93 Difference]: Finished difference Result 1412 states and 1981 transitions. [2020-12-01 15:24:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:08,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-12-01 15:24:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:08,669 INFO L225 Difference]: With dead ends: 1412 [2020-12-01 15:24:08,670 INFO L226 Difference]: Without dead ends: 1145 [2020-12-01 15:24:08,671 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-12-01 15:24:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-12-01 15:24:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 403. [2020-12-01 15:24:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-12-01 15:24:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 554 transitions. [2020-12-01 15:24:08,705 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 554 transitions. Word has length 65 [2020-12-01 15:24:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:08,706 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 554 transitions. [2020-12-01 15:24:08,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 554 transitions. [2020-12-01 15:24:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-01 15:24:08,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:08,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] [2020-12-01 15:24:08,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:24:08,716 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-12-01 15:24:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1255523790, now seen corresponding path program 1 times [2020-12-01 15:24:08,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:08,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311369933] [2020-12-01 15:24:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:08,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311369933] [2020-12-01 15:24:08,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:08,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:08,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326115490] [2020-12-01 15:24:08,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:08,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:08,810 INFO L87 Difference]: Start difference. First operand 403 states and 554 transitions. Second operand 3 states. [2020-12-01 15:24:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:08,921 INFO L93 Difference]: Finished difference Result 827 states and 1158 transitions. [2020-12-01 15:24:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:08,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-12-01 15:24:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:08,926 INFO L225 Difference]: With dead ends: 827 [2020-12-01 15:24:08,927 INFO L226 Difference]: Without dead ends: 560 [2020-12-01 15:24:08,928 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-12-01 15:24:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-01 15:24:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2020-12-01 15:24:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-01 15:24:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2020-12-01 15:24:08,963 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 67 [2020-12-01 15:24:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:08,963 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2020-12-01 15:24:08,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2020-12-01 15:24:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 15:24:08,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:08,965 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-12-01 15:24:08,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:24:08,966 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-12-01 15:24:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -363592984, now seen corresponding path program 1 times [2020-12-01 15:24:08,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:08,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803351479] [2020-12-01 15:24:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:09,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803351479] [2020-12-01 15:24:09,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:09,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:09,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227498879] [2020-12-01 15:24:09,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:09,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:09,057 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 3 states. [2020-12-01 15:24:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:09,140 INFO L93 Difference]: Finished difference Result 795 states and 1102 transitions. [2020-12-01 15:24:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:09,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-12-01 15:24:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:09,145 INFO L225 Difference]: With dead ends: 795 [2020-12-01 15:24:09,145 INFO L226 Difference]: Without dead ends: 548 [2020-12-01 15:24:09,146 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-12-01 15:24:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-12-01 15:24:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2020-12-01 15:24:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-12-01 15:24:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions. [2020-12-01 15:24:09,176 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 71 [2020-12-01 15:24:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:09,177 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 504 transitions. [2020-12-01 15:24:09,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions. [2020-12-01 15:24:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:24:09,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:09,178 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-12-01 15:24:09,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:24:09,179 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-12-01 15:24:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2014081046, now seen corresponding path program 1 times [2020-12-01 15:24:09,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:09,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495286960] [2020-12-01 15:24:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:09,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495286960] [2020-12-01 15:24:09,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:09,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:09,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353300417] [2020-12-01 15:24:09,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:09,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:09,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:09,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:09,393 INFO L87 Difference]: Start difference. First operand 371 states and 504 transitions. Second operand 6 states. [2020-12-01 15:24:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:09,684 INFO L93 Difference]: Finished difference Result 1063 states and 1470 transitions. [2020-12-01 15:24:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:09,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-12-01 15:24:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:09,690 INFO L225 Difference]: With dead ends: 1063 [2020-12-01 15:24:09,690 INFO L226 Difference]: Without dead ends: 828 [2020-12-01 15:24:09,692 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-12-01 15:24:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-12-01 15:24:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 396. [2020-12-01 15:24:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-12-01 15:24:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 539 transitions. [2020-12-01 15:24:09,729 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 539 transitions. Word has length 74 [2020-12-01 15:24:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:09,730 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 539 transitions. [2020-12-01 15:24:09,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 539 transitions. [2020-12-01 15:24:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:24:09,731 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:09,731 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-12-01 15:24:09,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:24:09,732 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-12-01 15:24:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1105027455, now seen corresponding path program 1 times [2020-12-01 15:24:09,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:09,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226947790] [2020-12-01 15:24:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:09,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226947790] [2020-12-01 15:24:09,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:09,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:24:09,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103173830] [2020-12-01 15:24:09,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:24:09,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:24:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:24:09,935 INFO L87 Difference]: Start difference. First operand 396 states and 539 transitions. Second operand 7 states. [2020-12-01 15:24:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:10,433 INFO L93 Difference]: Finished difference Result 1384 states and 1903 transitions. [2020-12-01 15:24:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:24:10,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2020-12-01 15:24:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:10,442 INFO L225 Difference]: With dead ends: 1384 [2020-12-01 15:24:10,442 INFO L226 Difference]: Without dead ends: 1131 [2020-12-01 15:24:10,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2020-12-01 15:24:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 424. [2020-12-01 15:24:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-12-01 15:24:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2020-12-01 15:24:10,498 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 74 [2020-12-01 15:24:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:10,499 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2020-12-01 15:24:10,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:24:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2020-12-01 15:24:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-01 15:24:10,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:10,500 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-12-01 15:24:10,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:24:10,501 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-12-01 15:24:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-12-01 15:24:10,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:10,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706298488] [2020-12-01 15:24:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:10,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706298488] [2020-12-01 15:24:10,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:10,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:10,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656506799] [2020-12-01 15:24:10,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:10,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:10,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:10,590 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand 4 states. [2020-12-01 15:24:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:10,799 INFO L93 Difference]: Finished difference Result 1099 states and 1491 transitions. [2020-12-01 15:24:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:10,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-01 15:24:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:10,806 INFO L225 Difference]: With dead ends: 1099 [2020-12-01 15:24:10,806 INFO L226 Difference]: Without dead ends: 840 [2020-12-01 15:24:10,807 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-12-01 15:24:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-12-01 15:24:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 637. [2020-12-01 15:24:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-12-01 15:24:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 846 transitions. [2020-12-01 15:24:10,892 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 846 transitions. Word has length 74 [2020-12-01 15:24:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:10,892 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 846 transitions. [2020-12-01 15:24:10,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 846 transitions. [2020-12-01 15:24:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 15:24:10,894 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:10,894 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-12-01 15:24:10,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:24:10,896 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-12-01 15:24:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1739304111, now seen corresponding path program 1 times [2020-12-01 15:24:10,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:10,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040777902] [2020-12-01 15:24:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:11,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040777902] [2020-12-01 15:24:11,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:11,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:11,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376120566] [2020-12-01 15:24:11,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:11,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:11,006 INFO L87 Difference]: Start difference. First operand 637 states and 846 transitions. Second operand 3 states. [2020-12-01 15:24:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:11,136 INFO L93 Difference]: Finished difference Result 1118 states and 1514 transitions. [2020-12-01 15:24:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-01 15:24:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:11,142 INFO L225 Difference]: With dead ends: 1118 [2020-12-01 15:24:11,142 INFO L226 Difference]: Without dead ends: 748 [2020-12-01 15:24:11,144 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-12-01 15:24:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-12-01 15:24:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 633. [2020-12-01 15:24:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-01 15:24:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 839 transitions. [2020-12-01 15:24:11,210 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 839 transitions. Word has length 75 [2020-12-01 15:24:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:11,210 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 839 transitions. [2020-12-01 15:24:11,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 839 transitions. [2020-12-01 15:24:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-01 15:24:11,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:11,212 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-12-01 15:24:11,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:24:11,213 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-12-01 15:24:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash -450501806, now seen corresponding path program 1 times [2020-12-01 15:24:11,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:11,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374169821] [2020-12-01 15:24:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:11,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-12-01 15:24:11,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374169821] [2020-12-01 15:24:11,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:11,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:11,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398888816] [2020-12-01 15:24:11,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:11,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:11,301 INFO L87 Difference]: Start difference. First operand 633 states and 839 transitions. Second operand 4 states. [2020-12-01 15:24:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:11,541 INFO L93 Difference]: Finished difference Result 1425 states and 1907 transitions. [2020-12-01 15:24:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:11,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-01 15:24:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:11,549 INFO L225 Difference]: With dead ends: 1425 [2020-12-01 15:24:11,549 INFO L226 Difference]: Without dead ends: 1045 [2020-12-01 15:24:11,551 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-12-01 15:24:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-12-01 15:24:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 844. [2020-12-01 15:24:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2020-12-01 15:24:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1109 transitions. [2020-12-01 15:24:11,645 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1109 transitions. Word has length 76 [2020-12-01 15:24:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:11,646 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1109 transitions. [2020-12-01 15:24:11,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1109 transitions. [2020-12-01 15:24:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-01 15:24:11,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:11,648 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-12-01 15:24:11,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:24:11,649 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-12-01 15:24:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1063318036, now seen corresponding path program 1 times [2020-12-01 15:24:11,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:11,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440004686] [2020-12-01 15:24:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:11,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440004686] [2020-12-01 15:24:11,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:11,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:11,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644310228] [2020-12-01 15:24:11,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:11,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:11,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:11,843 INFO L87 Difference]: Start difference. First operand 844 states and 1109 transitions. Second operand 6 states. [2020-12-01 15:24:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:12,499 INFO L93 Difference]: Finished difference Result 3164 states and 4201 transitions. [2020-12-01 15:24:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:24:12,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-01 15:24:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:12,517 INFO L225 Difference]: With dead ends: 3164 [2020-12-01 15:24:12,517 INFO L226 Difference]: Without dead ends: 2657 [2020-12-01 15:24:12,519 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-12-01 15:24:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2020-12-01 15:24:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 970. [2020-12-01 15:24:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-12-01 15:24:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1256 transitions. [2020-12-01 15:24:12,636 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1256 transitions. Word has length 76 [2020-12-01 15:24:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:12,636 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1256 transitions. [2020-12-01 15:24:12,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1256 transitions. [2020-12-01 15:24:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 15:24:12,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:12,639 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-12-01 15:24:12,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:24:12,640 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-12-01 15:24:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-12-01 15:24:12,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:12,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569289835] [2020-12-01 15:24:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:12,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569289835] [2020-12-01 15:24:12,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:12,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:12,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066633816] [2020-12-01 15:24:12,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:12,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:12,751 INFO L87 Difference]: Start difference. First operand 970 states and 1256 transitions. Second operand 4 states. [2020-12-01 15:24:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:13,016 INFO L93 Difference]: Finished difference Result 2345 states and 3078 transitions. [2020-12-01 15:24:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:13,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-01 15:24:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:13,027 INFO L225 Difference]: With dead ends: 2345 [2020-12-01 15:24:13,028 INFO L226 Difference]: Without dead ends: 1790 [2020-12-01 15:24:13,029 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-12-01 15:24:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-12-01 15:24:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1311. [2020-12-01 15:24:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2020-12-01 15:24:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1691 transitions. [2020-12-01 15:24:13,174 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1691 transitions. Word has length 77 [2020-12-01 15:24:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:13,175 INFO L481 AbstractCegarLoop]: Abstraction has 1311 states and 1691 transitions. [2020-12-01 15:24:13,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1691 transitions. [2020-12-01 15:24:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 15:24:13,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:13,178 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-12-01 15:24:13,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:24:13,179 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-12-01 15:24:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 236706532, now seen corresponding path program 1 times [2020-12-01 15:24:13,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:13,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012224426] [2020-12-01 15:24:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:13,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012224426] [2020-12-01 15:24:13,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:13,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:13,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420797566] [2020-12-01 15:24:13,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:13,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:13,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:13,233 INFO L87 Difference]: Start difference. First operand 1311 states and 1691 transitions. Second operand 3 states. [2020-12-01 15:24:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:13,570 INFO L93 Difference]: Finished difference Result 3105 states and 4022 transitions. [2020-12-01 15:24:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:13,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-01 15:24:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:13,583 INFO L225 Difference]: With dead ends: 3105 [2020-12-01 15:24:13,584 INFO L226 Difference]: Without dead ends: 2156 [2020-12-01 15:24:13,586 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-12-01 15:24:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2020-12-01 15:24:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1313. [2020-12-01 15:24:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2020-12-01 15:24:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1693 transitions. [2020-12-01 15:24:13,756 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1693 transitions. Word has length 78 [2020-12-01 15:24:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:13,757 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1693 transitions. [2020-12-01 15:24:13,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1693 transitions. [2020-12-01 15:24:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 15:24:13,759 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:24:13,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:24:13,760 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-12-01 15:24:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1666890696, now seen corresponding path program 1 times [2020-12-01 15:24:13,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:13,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169381895] [2020-12-01 15:24:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:13,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169381895] [2020-12-01 15:24:13,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:13,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:13,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349382959] [2020-12-01 15:24:13,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:13,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:13,887 INFO L87 Difference]: Start difference. First operand 1313 states and 1693 transitions. Second operand 6 states. [2020-12-01 15:24:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:14,241 INFO L93 Difference]: Finished difference Result 2077 states and 2712 transitions. [2020-12-01 15:24:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:24:14,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-12-01 15:24:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:14,255 INFO L225 Difference]: With dead ends: 2077 [2020-12-01 15:24:14,256 INFO L226 Difference]: Without dead ends: 2075 [2020-12-01 15:24:14,258 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-12-01 15:24:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-12-01 15:24:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1315. [2020-12-01 15:24:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-12-01 15:24:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1695 transitions. [2020-12-01 15:24:14,436 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1695 transitions. Word has length 79 [2020-12-01 15:24:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:14,436 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1695 transitions. [2020-12-01 15:24:14,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1695 transitions. [2020-12-01 15:24:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 15:24:14,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:14,439 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-12-01 15:24:14,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:24:14,439 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-12-01 15:24:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -275805135, now seen corresponding path program 1 times [2020-12-01 15:24:14,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:14,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317682935] [2020-12-01 15:24:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:14,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317682935] [2020-12-01 15:24:14,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:14,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:14,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336792237] [2020-12-01 15:24:14,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:14,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:14,618 INFO L87 Difference]: Start difference. First operand 1315 states and 1695 transitions. Second operand 6 states. [2020-12-01 15:24:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:15,127 INFO L93 Difference]: Finished difference Result 3115 states and 4121 transitions. [2020-12-01 15:24:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:15,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-12-01 15:24:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:15,141 INFO L225 Difference]: With dead ends: 3115 [2020-12-01 15:24:15,142 INFO L226 Difference]: Without dead ends: 2320 [2020-12-01 15:24:15,144 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-12-01 15:24:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2020-12-01 15:24:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1315. [2020-12-01 15:24:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-12-01 15:24:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1683 transitions. [2020-12-01 15:24:15,298 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1683 transitions. Word has length 79 [2020-12-01 15:24:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:15,298 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1683 transitions. [2020-12-01 15:24:15,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1683 transitions. [2020-12-01 15:24:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 15:24:15,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:15,301 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-12-01 15:24:15,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:24:15,302 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-12-01 15:24:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1725608005, now seen corresponding path program 1 times [2020-12-01 15:24:15,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:15,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422605023] [2020-12-01 15:24:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:15,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422605023] [2020-12-01 15:24:15,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:15,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:15,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819229532] [2020-12-01 15:24:15,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:15,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:15,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:15,395 INFO L87 Difference]: Start difference. First operand 1315 states and 1683 transitions. Second operand 4 states. [2020-12-01 15:24:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:15,652 INFO L93 Difference]: Finished difference Result 2627 states and 3386 transitions. [2020-12-01 15:24:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:15,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-01 15:24:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:15,661 INFO L225 Difference]: With dead ends: 2627 [2020-12-01 15:24:15,661 INFO L226 Difference]: Without dead ends: 1384 [2020-12-01 15:24:15,663 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-12-01 15:24:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-12-01 15:24:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1027. [2020-12-01 15:24:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2020-12-01 15:24:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1327 transitions. [2020-12-01 15:24:15,817 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1327 transitions. Word has length 79 [2020-12-01 15:24:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:15,817 INFO L481 AbstractCegarLoop]: Abstraction has 1027 states and 1327 transitions. [2020-12-01 15:24:15,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1327 transitions. [2020-12-01 15:24:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-01 15:24:15,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:15,819 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-12-01 15:24:15,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:24:15,819 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-12-01 15:24:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-12-01 15:24:15,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:15,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146419069] [2020-12-01 15:24:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:15,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146419069] [2020-12-01 15:24:15,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:15,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:24:15,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262752171] [2020-12-01 15:24:15,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:24:15,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:24:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:24:15,866 INFO L87 Difference]: Start difference. First operand 1027 states and 1327 transitions. Second operand 3 states. [2020-12-01 15:24:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:16,175 INFO L93 Difference]: Finished difference Result 2433 states and 3163 transitions. [2020-12-01 15:24:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:24:16,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-01 15:24:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:16,196 INFO L225 Difference]: With dead ends: 2433 [2020-12-01 15:24:16,196 INFO L226 Difference]: Without dead ends: 1550 [2020-12-01 15:24:16,199 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-12-01 15:24:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2020-12-01 15:24:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1033. [2020-12-01 15:24:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-12-01 15:24:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1333 transitions. [2020-12-01 15:24:16,361 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1333 transitions. Word has length 80 [2020-12-01 15:24:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:16,361 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 1333 transitions. [2020-12-01 15:24:16,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:24:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1333 transitions. [2020-12-01 15:24:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-01 15:24:16,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:16,363 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-12-01 15:24:16,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:24:16,364 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-12-01 15:24:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1203231905, now seen corresponding path program 1 times [2020-12-01 15:24:16,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:16,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494499220] [2020-12-01 15:24:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:16,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494499220] [2020-12-01 15:24:16,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:16,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:16,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126041443] [2020-12-01 15:24:16,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:16,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:16,461 INFO L87 Difference]: Start difference. First operand 1033 states and 1333 transitions. Second operand 4 states. [2020-12-01 15:24:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:16,695 INFO L93 Difference]: Finished difference Result 2381 states and 3087 transitions. [2020-12-01 15:24:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:16,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-01 15:24:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:16,711 INFO L225 Difference]: With dead ends: 2381 [2020-12-01 15:24:16,712 INFO L226 Difference]: Without dead ends: 1444 [2020-12-01 15:24:16,714 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-12-01 15:24:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-12-01 15:24:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 975. [2020-12-01 15:24:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2020-12-01 15:24:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1253 transitions. [2020-12-01 15:24:16,839 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1253 transitions. Word has length 80 [2020-12-01 15:24:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:16,840 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1253 transitions. [2020-12-01 15:24:16,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1253 transitions. [2020-12-01 15:24:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-01 15:24:16,841 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:16,841 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-12-01 15:24:16,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-01 15:24:16,842 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-12-01 15:24:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -868242773, now seen corresponding path program 1 times [2020-12-01 15:24:16,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:16,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73918976] [2020-12-01 15:24:16,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:17,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73918976] [2020-12-01 15:24:17,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:17,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:17,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599578619] [2020-12-01 15:24:17,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:17,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:17,012 INFO L87 Difference]: Start difference. First operand 975 states and 1253 transitions. Second operand 6 states. [2020-12-01 15:24:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:17,514 INFO L93 Difference]: Finished difference Result 3200 states and 4277 transitions. [2020-12-01 15:24:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:17,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-12-01 15:24:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:17,526 INFO L225 Difference]: With dead ends: 3200 [2020-12-01 15:24:17,526 INFO L226 Difference]: Without dead ends: 2416 [2020-12-01 15:24:17,529 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-12-01 15:24:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2020-12-01 15:24:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 963. [2020-12-01 15:24:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-12-01 15:24:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1241 transitions. [2020-12-01 15:24:17,676 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1241 transitions. Word has length 82 [2020-12-01 15:24:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:17,677 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 1241 transitions. [2020-12-01 15:24:17,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1241 transitions. [2020-12-01 15:24:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 15:24:17,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:17,678 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-12-01 15:24:17,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-01 15:24:17,679 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-12-01 15:24:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 528163420, now seen corresponding path program 1 times [2020-12-01 15:24:17,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:17,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93623335] [2020-12-01 15:24:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:17,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93623335] [2020-12-01 15:24:17,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:17,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:24:17,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853679439] [2020-12-01 15:24:17,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:17,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:24:17,791 INFO L87 Difference]: Start difference. First operand 963 states and 1241 transitions. Second operand 6 states. [2020-12-01 15:24:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:18,128 INFO L93 Difference]: Finished difference Result 2288 states and 3068 transitions. [2020-12-01 15:24:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:24:18,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-12-01 15:24:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:18,134 INFO L225 Difference]: With dead ends: 2288 [2020-12-01 15:24:18,134 INFO L226 Difference]: Without dead ends: 1504 [2020-12-01 15:24:18,136 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-12-01 15:24:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2020-12-01 15:24:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 969. [2020-12-01 15:24:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-12-01 15:24:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1247 transitions. [2020-12-01 15:24:18,293 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1247 transitions. Word has length 83 [2020-12-01 15:24:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:18,293 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1247 transitions. [2020-12-01 15:24:18,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1247 transitions. [2020-12-01 15:24:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-01 15:24:18,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:18,298 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-12-01 15:24:18,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 15:24:18,298 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-12-01 15:24:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -953396613, now seen corresponding path program 1 times [2020-12-01 15:24:18,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:18,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402369907] [2020-12-01 15:24:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:18,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402369907] [2020-12-01 15:24:18,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806430818] [2020-12-01 15:24:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:18,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-01 15:24:18,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:24:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-01 15:24:19,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-01 15:24:19,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2020-12-01 15:24:19,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458265907] [2020-12-01 15:24:19,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:24:19,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:24:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:24:19,180 INFO L87 Difference]: Start difference. First operand 969 states and 1247 transitions. Second operand 6 states. [2020-12-01 15:24:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:19,746 INFO L93 Difference]: Finished difference Result 2493 states and 3319 transitions. [2020-12-01 15:24:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-01 15:24:19,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2020-12-01 15:24:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:19,750 INFO L225 Difference]: With dead ends: 2493 [2020-12-01 15:24:19,750 INFO L226 Difference]: Without dead ends: 1703 [2020-12-01 15:24:19,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:24:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2020-12-01 15:24:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 969. [2020-12-01 15:24:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-12-01 15:24:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1246 transitions. [2020-12-01 15:24:19,912 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1246 transitions. Word has length 133 [2020-12-01 15:24:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:19,912 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1246 transitions. [2020-12-01 15:24:19,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:24:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1246 transitions. [2020-12-01 15:24:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 15:24:19,915 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:19,916 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, 1, 1, 1, 1] [2020-12-01 15:24:20,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-01 15:24:20,132 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-12-01 15:24:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1597191096, now seen corresponding path program 1 times [2020-12-01 15:24:20,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:20,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817283472] [2020-12-01 15:24:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:20,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817283472] [2020-12-01 15:24:20,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443412874] [2020-12-01 15:24:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:20,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-01 15:24:20,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:24:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:20,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:24:20,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-12-01 15:24:20,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644043546] [2020-12-01 15:24:20,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-01 15:24:20,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-01 15:24:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:20,922 INFO L87 Difference]: Start difference. First operand 969 states and 1246 transitions. Second operand 13 states. [2020-12-01 15:24:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:34,492 INFO L93 Difference]: Finished difference Result 16611 states and 22045 transitions. [2020-12-01 15:24:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2020-12-01 15:24:34,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2020-12-01 15:24:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:34,525 INFO L225 Difference]: With dead ends: 16611 [2020-12-01 15:24:34,525 INFO L226 Difference]: Without dead ends: 15827 [2020-12-01 15:24:34,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28995 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2020-12-01 15:24:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15827 states. [2020-12-01 15:24:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15827 to 2668. [2020-12-01 15:24:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2020-12-01 15:24:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3449 transitions. [2020-12-01 15:24:35,215 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3449 transitions. Word has length 137 [2020-12-01 15:24:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:35,216 INFO L481 AbstractCegarLoop]: Abstraction has 2668 states and 3449 transitions. [2020-12-01 15:24:35,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-01 15:24:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3449 transitions. [2020-12-01 15:24:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 15:24:35,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:35,224 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, 1, 1] [2020-12-01 15:24:35,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:24:35,447 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-12-01 15:24:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash 308217842, now seen corresponding path program 1 times [2020-12-01 15:24:35,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:35,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407006562] [2020-12-01 15:24:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-01 15:24:35,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407006562] [2020-12-01 15:24:35,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:35,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:24:35,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009763951] [2020-12-01 15:24:35,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:24:35,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:35,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:24:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:24:35,666 INFO L87 Difference]: Start difference. First operand 2668 states and 3449 transitions. Second operand 7 states. [2020-12-01 15:24:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:36,841 INFO L93 Difference]: Finished difference Result 7058 states and 9434 transitions. [2020-12-01 15:24:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-01 15:24:36,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2020-12-01 15:24:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:36,851 INFO L225 Difference]: With dead ends: 7058 [2020-12-01 15:24:36,851 INFO L226 Difference]: Without dead ends: 4609 [2020-12-01 15:24:36,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:24:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2020-12-01 15:24:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 2325. [2020-12-01 15:24:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2020-12-01 15:24:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3008 transitions. [2020-12-01 15:24:37,294 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3008 transitions. Word has length 138 [2020-12-01 15:24:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:37,294 INFO L481 AbstractCegarLoop]: Abstraction has 2325 states and 3008 transitions. [2020-12-01 15:24:37,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:24:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3008 transitions. [2020-12-01 15:24:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-01 15:24:37,300 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:37,301 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, 1, 1, 1, 1, 1] [2020-12-01 15:24:37,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 15:24:37,301 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-12-01 15:24:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash -897619970, now seen corresponding path program 1 times [2020-12-01 15:24:37,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:37,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095657950] [2020-12-01 15:24:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 15:24:37,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095657950] [2020-12-01 15:24:37,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:37,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:24:37,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328919131] [2020-12-01 15:24:37,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:24:37,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:24:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:24:37,463 INFO L87 Difference]: Start difference. First operand 2325 states and 3008 transitions. Second operand 7 states. [2020-12-01 15:24:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:39,624 INFO L93 Difference]: Finished difference Result 13887 states and 18520 transitions. [2020-12-01 15:24:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-01 15:24:39,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2020-12-01 15:24:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:39,651 INFO L225 Difference]: With dead ends: 13887 [2020-12-01 15:24:39,652 INFO L226 Difference]: Without dead ends: 11821 [2020-12-01 15:24:39,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:24:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-12-01 15:24:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 2781. [2020-12-01 15:24:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2020-12-01 15:24:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3538 transitions. [2020-12-01 15:24:40,295 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3538 transitions. Word has length 139 [2020-12-01 15:24:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:40,296 INFO L481 AbstractCegarLoop]: Abstraction has 2781 states and 3538 transitions. [2020-12-01 15:24:40,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:24:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3538 transitions. [2020-12-01 15:24:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 15:24:40,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:40,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:24:40,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 15:24:40,303 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-12-01 15:24:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:40,304 INFO L82 PathProgramCache]: Analyzing trace with hash 905967205, now seen corresponding path program 1 times [2020-12-01 15:24:40,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:40,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051568993] [2020-12-01 15:24:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 15:24:40,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051568993] [2020-12-01 15:24:40,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:40,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:40,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463654984] [2020-12-01 15:24:40,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:40,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:40,453 INFO L87 Difference]: Start difference. First operand 2781 states and 3538 transitions. Second operand 4 states. [2020-12-01 15:24:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:40,879 INFO L93 Difference]: Finished difference Result 4915 states and 6288 transitions. [2020-12-01 15:24:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:24:40,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-01 15:24:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:40,884 INFO L225 Difference]: With dead ends: 4915 [2020-12-01 15:24:40,884 INFO L226 Difference]: Without dead ends: 2285 [2020-12-01 15:24:40,888 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-12-01 15:24:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2020-12-01 15:24:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2285. [2020-12-01 15:24:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2020-12-01 15:24:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2901 transitions. [2020-12-01 15:24:41,385 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2901 transitions. Word has length 140 [2020-12-01 15:24:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:41,386 INFO L481 AbstractCegarLoop]: Abstraction has 2285 states and 2901 transitions. [2020-12-01 15:24:41,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2901 transitions. [2020-12-01 15:24:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 15:24:41,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:41,393 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] [2020-12-01 15:24:41,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-01 15:24:41,393 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-12-01 15:24:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1814881885, now seen corresponding path program 1 times [2020-12-01 15:24:41,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:41,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052099559] [2020-12-01 15:24:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:41,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052099559] [2020-12-01 15:24:41,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732830823] [2020-12-01 15:24:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:41,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-01 15:24:41,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:24:42,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:24:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:42,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:24:42,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2020-12-01 15:24:42,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483327869] [2020-12-01 15:24:42,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:24:42,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:24:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:24:42,441 INFO L87 Difference]: Start difference. First operand 2285 states and 2901 transitions. Second operand 16 states. [2020-12-01 15:24:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:44,652 INFO L93 Difference]: Finished difference Result 6319 states and 8067 transitions. [2020-12-01 15:24:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-01 15:24:44,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2020-12-01 15:24:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:44,659 INFO L225 Difference]: With dead ends: 6319 [2020-12-01 15:24:44,659 INFO L226 Difference]: Without dead ends: 4243 [2020-12-01 15:24:44,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2020-12-01 15:24:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2020-12-01 15:24:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2535. [2020-12-01 15:24:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2020-12-01 15:24:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3212 transitions. [2020-12-01 15:24:45,076 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3212 transitions. Word has length 140 [2020-12-01 15:24:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:45,076 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3212 transitions. [2020-12-01 15:24:45,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:24:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3212 transitions. [2020-12-01 15:24:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 15:24:45,080 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:45,081 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] [2020-12-01 15:24:45,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-01 15:24:45,281 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-12-01 15:24:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:45,282 INFO L82 PathProgramCache]: Analyzing trace with hash -326978593, now seen corresponding path program 1 times [2020-12-01 15:24:45,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:45,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728987829] [2020-12-01 15:24:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-01 15:24:45,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728987829] [2020-12-01 15:24:45,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:45,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:45,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794902797] [2020-12-01 15:24:45,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:24:45,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:24:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:24:45,396 INFO L87 Difference]: Start difference. First operand 2535 states and 3212 transitions. Second operand 5 states. [2020-12-01 15:24:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:46,096 INFO L93 Difference]: Finished difference Result 4786 states and 6108 transitions. [2020-12-01 15:24:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:24:46,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2020-12-01 15:24:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:46,100 INFO L225 Difference]: With dead ends: 4786 [2020-12-01 15:24:46,101 INFO L226 Difference]: Without dead ends: 2401 [2020-12-01 15:24:46,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-01 15:24:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2020-12-01 15:24:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2401. [2020-12-01 15:24:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2020-12-01 15:24:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3044 transitions. [2020-12-01 15:24:46,533 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3044 transitions. Word has length 140 [2020-12-01 15:24:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:46,533 INFO L481 AbstractCegarLoop]: Abstraction has 2401 states and 3044 transitions. [2020-12-01 15:24:46,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:24:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3044 transitions. [2020-12-01 15:24:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-01 15:24:46,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:46,539 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, 1, 1, 1, 1] [2020-12-01 15:24:46,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-01 15:24:46,540 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-12-01 15:24:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2069530669, now seen corresponding path program 1 times [2020-12-01 15:24:46,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:46,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757276878] [2020-12-01 15:24:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:46,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757276878] [2020-12-01 15:24:46,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949176100] [2020-12-01 15:24:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/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-12-01 15:24:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:47,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-01 15:24:47,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:24:47,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:24:47,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:24:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:24:47,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:24:47,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2020-12-01 15:24:47,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227946879] [2020-12-01 15:24:47,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-01 15:24:47,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:47,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-01 15:24:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-12-01 15:24:47,551 INFO L87 Difference]: Start difference. First operand 2401 states and 3044 transitions. Second operand 16 states. [2020-12-01 15:24:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:49,928 INFO L93 Difference]: Finished difference Result 6593 states and 8387 transitions. [2020-12-01 15:24:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-01 15:24:49,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 141 [2020-12-01 15:24:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:49,933 INFO L225 Difference]: With dead ends: 6593 [2020-12-01 15:24:49,933 INFO L226 Difference]: Without dead ends: 4401 [2020-12-01 15:24:49,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=1453, Unknown=0, NotChecked=0, Total=1806 [2020-12-01 15:24:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2020-12-01 15:24:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 2676. [2020-12-01 15:24:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2020-12-01 15:24:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3385 transitions. [2020-12-01 15:24:50,546 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3385 transitions. Word has length 141 [2020-12-01 15:24:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:50,547 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3385 transitions. [2020-12-01 15:24:50,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-01 15:24:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3385 transitions. [2020-12-01 15:24:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-01 15:24:50,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:50,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-01 15:24:50,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:24:50,774 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-12-01 15:24:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1446249067, now seen corresponding path program 1 times [2020-12-01 15:24:50,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:50,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664256813] [2020-12-01 15:24:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:24:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 15:24:50,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664256813] [2020-12-01 15:24:50,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:24:50,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:24:50,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682868145] [2020-12-01 15:24:50,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:24:50,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:24:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:24:50,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:24:50,914 INFO L87 Difference]: Start difference. First operand 2676 states and 3385 transitions. Second operand 4 states. [2020-12-01 15:24:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:24:51,488 INFO L93 Difference]: Finished difference Result 4995 states and 6358 transitions. [2020-12-01 15:24:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:24:51,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2020-12-01 15:24:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:24:51,491 INFO L225 Difference]: With dead ends: 4995 [2020-12-01 15:24:51,491 INFO L226 Difference]: Without dead ends: 2471 [2020-12-01 15:24:51,493 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-12-01 15:24:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2020-12-01 15:24:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2459. [2020-12-01 15:24:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2020-12-01 15:24:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3098 transitions. [2020-12-01 15:24:51,950 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3098 transitions. Word has length 141 [2020-12-01 15:24:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:24:51,951 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3098 transitions. [2020-12-01 15:24:51,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:24:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3098 transitions. [2020-12-01 15:24:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 15:24:51,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:24:51,956 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-12-01 15:24:51,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-01 15:24:51,956 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-12-01 15:24:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:24:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash 583046840, now seen corresponding path program 1 times [2020-12-01 15:24:51,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:24:51,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048249356] [2020-12-01 15:24:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:24:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:24:52,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:24:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:24:52,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:24:52,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:24:52,225 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:24:52,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-01 15:24:52,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:24:52 BoogieIcfgContainer [2020-12-01 15:24:52,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:24:52,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:24:52,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:24:52,517 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:24:52,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:24:04" (3/4) ... [2020-12-01 15:24:52,521 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:24:52,820 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1e7c6783-a771-4142-81a4-c772682180c1/bin/uautomizer/witness.graphml [2020-12-01 15:24:52,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:24:52,822 INFO L168 Benchmark]: Toolchain (without parser) took 50983.72 ms. Allocated memory was 81.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 51.4 MB in the beginning and 946.1 MB in the end (delta: -894.7 MB). Peak memory consumption was 620.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,823 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 40.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:24:52,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.98 ms. Allocated memory is still 81.8 MB. Free memory was 51.2 MB in the beginning and 52.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.48 ms. Allocated memory is still 81.8 MB. Free memory was 52.6 MB in the beginning and 47.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,824 INFO L168 Benchmark]: Boogie Preprocessor took 99.38 ms. Allocated memory is still 81.8 MB. Free memory was 47.8 MB in the beginning and 44.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,824 INFO L168 Benchmark]: RCFGBuilder took 1789.08 ms. Allocated memory was 81.8 MB in the beginning and 102.8 MB in the end (delta: 21.0 MB). Free memory was 44.0 MB in the beginning and 74.3 MB in the end (delta: -30.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,825 INFO L168 Benchmark]: TraceAbstraction took 47852.32 ms. Allocated memory was 102.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 74.3 MB in the beginning and 991.4 MB in the end (delta: -917.1 MB). Peak memory consumption was 577.3 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,825 INFO L168 Benchmark]: Witness Printer took 303.88 ms. Allocated memory is still 1.6 GB. Free memory was 991.4 MB in the beginning and 946.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:24:52,828 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.42 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 40.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 724.98 ms. Allocated memory is still 81.8 MB. Free memory was 51.2 MB in the beginning and 52.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 206.48 ms. Allocated memory is still 81.8 MB. Free memory was 52.6 MB in the beginning and 47.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 99.38 ms. Allocated memory is still 81.8 MB. Free memory was 47.8 MB in the beginning and 44.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1789.08 ms. Allocated memory was 81.8 MB in the beginning and 102.8 MB in the end (delta: 21.0 MB). Free memory was 44.0 MB in the beginning and 74.3 MB in the end (delta: -30.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 47852.32 ms. Allocated memory was 102.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 74.3 MB in the beginning and 991.4 MB in the end (delta: -917.1 MB). Peak memory consumption was 577.3 MB. Max. memory is 16.1 GB. * Witness Printer took 303.88 ms. Allocated memory is still 1.6 GB. Free memory was 991.4 MB in the beginning and 946.1 MB in the end (delta: 45.3 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: 47.4s, OverallIterations: 38, TraceHistogramMax: 2, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16919 SDtfs, 36960 SDslu, 41031 SDs, 0 SdLazy, 7101 SolverSat, 538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 725 SyntacticMatches, 16 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29837 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2781occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 40974 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 3817 NumberOfCodeBlocks, 3817 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3634 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320138 SizeOfPredicates, 24 NumberOfNonLiveVariables, 3103 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 41 InterpolantComputations, 34 PerfectInterpolantSequences, 390/513 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...