./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1b13681321768ca55f91678b1940c42ff4738299 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:54:10,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:54:10,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:54:10,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:54:10,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:54:10,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:54:10,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:54:10,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:54:10,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:54:10,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:54:10,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:54:10,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:54:10,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:54:10,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:54:10,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:54:10,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:54:10,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:54:10,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:54:10,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:54:10,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:54:10,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:54:10,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:54:10,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:54:10,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:54:10,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:54:10,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:54:10,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:54:10,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:54:10,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:54:10,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:54:10,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:54:10,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:54:10,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:54:10,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:54:10,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:54:10,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:54:10,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:54:10,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:54:10,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:54:10,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:54:10,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:54:10,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:54:10,497 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:54:10,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:54:10,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:54:10,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:54:10,501 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:54:10,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:54:10,502 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:54:10,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:54:10,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:54:10,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:54:10,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:54:10,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:54:10,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:54:10,504 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:54:10,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:54:10,505 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:54:10,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:54:10,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:54:10,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:54:10,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:54:10,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:54:10,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:54:10,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:54:10,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:54:10,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:54:10,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:54:10,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:54:10,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:54:10,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:54:10,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1b13681321768ca55f91678b1940c42ff4738299 [2020-10-20 01:54:10,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:54:10,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:54:10,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:54:10,767 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:54:10,768 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:54:10,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-10-20 01:54:10,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff87e1bed/466599829c764b54b39989cc28866966/FLAGce6fe5e93 [2020-10-20 01:54:11,352 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:54:11,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-10-20 01:54:11,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff87e1bed/466599829c764b54b39989cc28866966/FLAGce6fe5e93 [2020-10-20 01:54:11,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff87e1bed/466599829c764b54b39989cc28866966 [2020-10-20 01:54:11,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:54:11,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:54:11,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:54:11,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:54:11,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:54:11,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:54:11" (1/1) ... [2020-10-20 01:54:11,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b75600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:11, skipping insertion in model container [2020-10-20 01:54:11,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:54:11" (1/1) ... [2020-10-20 01:54:11,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:54:11,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:54:12,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:54:12,119 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:54:12,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:54:12,244 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:54:12,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12 WrapperNode [2020-10-20 01:54:12,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:54:12,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:54:12,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:54:12,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:54:12,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:54:12,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:54:12,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:54:12,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:54:12,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... [2020-10-20 01:54:12,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:54:12,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:54:12,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:54:12,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:54:12,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 01:54:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:54:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:54:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:54:12,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:54:13,603 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:54:13,604 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-10-20 01:54:13,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:13 BoogieIcfgContainer [2020-10-20 01:54:13,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:54:13,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:54:13,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:54:13,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:54:13,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:54:11" (1/3) ... [2020-10-20 01:54:13,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf86b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:54:13, skipping insertion in model container [2020-10-20 01:54:13,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:54:12" (2/3) ... [2020-10-20 01:54:13,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf86b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:54:13, skipping insertion in model container [2020-10-20 01:54:13,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:13" (3/3) ... [2020-10-20 01:54:13,615 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2020-10-20 01:54:13,627 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:54:13,634 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-10-20 01:54:13,645 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-10-20 01:54:13,671 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:54:13,671 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:54:13,672 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:54:13,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:54:13,672 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:54:13,673 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:54:13,673 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:54:13,673 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:54:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2020-10-20 01:54:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:54:13,710 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:13,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:13,712 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-10-20 01:54:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-10-20 01:54:13,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:13,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221726989] [2020-10-20 01:54:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:13,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221726989] [2020-10-20 01:54:13,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:13,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:54:13,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929243512] [2020-10-20 01:54:13,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 01:54:13,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 01:54:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 01:54:13,977 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 2 states. [2020-10-20 01:54:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:14,033 INFO L93 Difference]: Finished difference Result 591 states and 911 transitions. [2020-10-20 01:54:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 01:54:14,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-10-20 01:54:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:14,062 INFO L225 Difference]: With dead ends: 591 [2020-10-20 01:54:14,062 INFO L226 Difference]: Without dead ends: 290 [2020-10-20 01:54:14,071 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-10-20 01:54:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-20 01:54:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-10-20 01:54:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 01:54:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2020-10-20 01:54:14,129 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 33 [2020-10-20 01:54:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:14,130 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2020-10-20 01:54:14,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 01:54:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2020-10-20 01:54:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:54:14,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:14,132 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-10-20 01:54:14,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:54:14,133 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-10-20 01:54:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-10-20 01:54:14,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:14,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519912216] [2020-10-20 01:54:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:14,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519912216] [2020-10-20 01:54:14,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:14,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:14,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365725964] [2020-10-20 01:54:14,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:14,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:14,246 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand 4 states. [2020-10-20 01:54:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:14,332 INFO L93 Difference]: Finished difference Result 566 states and 822 transitions. [2020-10-20 01:54:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:54:14,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-10-20 01:54:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:14,336 INFO L225 Difference]: With dead ends: 566 [2020-10-20 01:54:14,336 INFO L226 Difference]: Without dead ends: 290 [2020-10-20 01:54:14,338 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-10-20 01:54:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-20 01:54:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-10-20 01:54:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 01:54:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2020-10-20 01:54:14,523 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 33 [2020-10-20 01:54:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:14,524 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2020-10-20 01:54:14,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2020-10-20 01:54:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-20 01:54:14,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:14,527 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-10-20 01:54:14,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:54:14,528 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-10-20 01:54:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-10-20 01:54:14,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:14,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493800760] [2020-10-20 01:54:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:14,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493800760] [2020-10-20 01:54:14,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:14,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:14,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678900648] [2020-10-20 01:54:14,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:14,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:14,692 INFO L87 Difference]: Start difference. First operand 290 states and 412 transitions. Second operand 3 states. [2020-10-20 01:54:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:14,748 INFO L93 Difference]: Finished difference Result 596 states and 856 transitions. [2020-10-20 01:54:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:14,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-20 01:54:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:14,752 INFO L225 Difference]: With dead ends: 596 [2020-10-20 01:54:14,752 INFO L226 Difference]: Without dead ends: 323 [2020-10-20 01:54:14,754 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-10-20 01:54:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-10-20 01:54:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 266. [2020-10-20 01:54:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-20 01:54:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2020-10-20 01:54:14,770 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 44 [2020-10-20 01:54:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:14,771 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2020-10-20 01:54:14,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2020-10-20 01:54:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:54:14,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:14,774 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-10-20 01:54:14,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:54:14,774 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-10-20 01:54:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash 906623156, now seen corresponding path program 1 times [2020-10-20 01:54:14,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:14,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799312955] [2020-10-20 01:54:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:14,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799312955] [2020-10-20 01:54:14,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:14,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:14,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823269463] [2020-10-20 01:54:14,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:14,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:14,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:14,928 INFO L87 Difference]: Start difference. First operand 266 states and 376 transitions. Second operand 3 states. [2020-10-20 01:54:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:14,966 INFO L93 Difference]: Finished difference Result 741 states and 1059 transitions. [2020-10-20 01:54:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:14,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-10-20 01:54:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:14,971 INFO L225 Difference]: With dead ends: 741 [2020-10-20 01:54:14,971 INFO L226 Difference]: Without dead ends: 492 [2020-10-20 01:54:14,972 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-10-20 01:54:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-20 01:54:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 299. [2020-10-20 01:54:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-20 01:54:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 424 transitions. [2020-10-20 01:54:14,992 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 424 transitions. Word has length 53 [2020-10-20 01:54:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:14,993 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 424 transitions. [2020-10-20 01:54:14,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 424 transitions. [2020-10-20 01:54:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:54:14,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:14,996 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-10-20 01:54:14,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:54:14,997 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-10-20 01:54:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1464669016, now seen corresponding path program 1 times [2020-10-20 01:54:14,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:14,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893969092] [2020-10-20 01:54:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:15,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893969092] [2020-10-20 01:54:15,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:15,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:15,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920001273] [2020-10-20 01:54:15,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:15,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:15,135 INFO L87 Difference]: Start difference. First operand 299 states and 424 transitions. Second operand 3 states. [2020-10-20 01:54:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:15,193 INFO L93 Difference]: Finished difference Result 819 states and 1172 transitions. [2020-10-20 01:54:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:15,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-10-20 01:54:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:15,199 INFO L225 Difference]: With dead ends: 819 [2020-10-20 01:54:15,199 INFO L226 Difference]: Without dead ends: 537 [2020-10-20 01:54:15,200 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-10-20 01:54:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-20 01:54:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 320. [2020-10-20 01:54:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-20 01:54:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 454 transitions. [2020-10-20 01:54:15,222 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 454 transitions. Word has length 54 [2020-10-20 01:54:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:15,223 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 454 transitions. [2020-10-20 01:54:15,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 454 transitions. [2020-10-20 01:54:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:54:15,233 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:15,234 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-10-20 01:54:15,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:54:15,249 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-10-20 01:54:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -784610646, now seen corresponding path program 1 times [2020-10-20 01:54:15,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:15,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477543492] [2020-10-20 01:54:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:15,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477543492] [2020-10-20 01:54:15,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:15,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:15,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532403977] [2020-10-20 01:54:15,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:15,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:15,347 INFO L87 Difference]: Start difference. First operand 320 states and 454 transitions. Second operand 5 states. [2020-10-20 01:54:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:15,677 INFO L93 Difference]: Finished difference Result 1000 states and 1433 transitions. [2020-10-20 01:54:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:54:15,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-10-20 01:54:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:15,687 INFO L225 Difference]: With dead ends: 1000 [2020-10-20 01:54:15,689 INFO L226 Difference]: Without dead ends: 697 [2020-10-20 01:54:15,690 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-10-20 01:54:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-10-20 01:54:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 418. [2020-10-20 01:54:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-20 01:54:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 591 transitions. [2020-10-20 01:54:15,716 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 591 transitions. Word has length 54 [2020-10-20 01:54:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:15,720 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 591 transitions. [2020-10-20 01:54:15,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 591 transitions. [2020-10-20 01:54:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-10-20 01:54:15,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:15,722 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-10-20 01:54:15,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:54:15,723 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-10-20 01:54:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1195121816, now seen corresponding path program 1 times [2020-10-20 01:54:15,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:15,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461203326] [2020-10-20 01:54:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:15,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461203326] [2020-10-20 01:54:15,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:15,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:15,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110226282] [2020-10-20 01:54:15,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:15,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:15,855 INFO L87 Difference]: Start difference. First operand 418 states and 591 transitions. Second operand 5 states. [2020-10-20 01:54:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:16,128 INFO L93 Difference]: Finished difference Result 1000 states and 1425 transitions. [2020-10-20 01:54:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:54:16,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-10-20 01:54:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:16,133 INFO L225 Difference]: With dead ends: 1000 [2020-10-20 01:54:16,133 INFO L226 Difference]: Without dead ends: 697 [2020-10-20 01:54:16,135 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-10-20 01:54:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-10-20 01:54:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 418. [2020-10-20 01:54:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-20 01:54:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2020-10-20 01:54:16,156 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 55 [2020-10-20 01:54:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:16,156 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2020-10-20 01:54:16,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2020-10-20 01:54:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-20 01:54:16,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:16,158 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-10-20 01:54:16,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:54:16,159 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-10-20 01:54:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash -555337993, now seen corresponding path program 1 times [2020-10-20 01:54:16,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:16,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821776520] [2020-10-20 01:54:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:16,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821776520] [2020-10-20 01:54:16,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:16,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:16,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872190255] [2020-10-20 01:54:16,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:16,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:16,242 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand 3 states. [2020-10-20 01:54:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:16,282 INFO L93 Difference]: Finished difference Result 840 states and 1196 transitions. [2020-10-20 01:54:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:16,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-10-20 01:54:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:16,286 INFO L225 Difference]: With dead ends: 840 [2020-10-20 01:54:16,287 INFO L226 Difference]: Without dead ends: 537 [2020-10-20 01:54:16,288 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-10-20 01:54:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-20 01:54:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 413. [2020-10-20 01:54:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-20 01:54:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 579 transitions. [2020-10-20 01:54:16,308 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 579 transitions. Word has length 56 [2020-10-20 01:54:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:16,309 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 579 transitions. [2020-10-20 01:54:16,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 579 transitions. [2020-10-20 01:54:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-20 01:54:16,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:16,310 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-10-20 01:54:16,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:54:16,311 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-10-20 01:54:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash 819502993, now seen corresponding path program 1 times [2020-10-20 01:54:16,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:16,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077974821] [2020-10-20 01:54:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:16,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077974821] [2020-10-20 01:54:16,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:16,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:16,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833361740] [2020-10-20 01:54:16,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:16,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:16,370 INFO L87 Difference]: Start difference. First operand 413 states and 579 transitions. Second operand 3 states. [2020-10-20 01:54:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:16,459 INFO L93 Difference]: Finished difference Result 839 states and 1195 transitions. [2020-10-20 01:54:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:16,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-10-20 01:54:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:16,463 INFO L225 Difference]: With dead ends: 839 [2020-10-20 01:54:16,463 INFO L226 Difference]: Without dead ends: 541 [2020-10-20 01:54:16,464 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-10-20 01:54:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-10-20 01:54:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 393. [2020-10-20 01:54:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-20 01:54:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 547 transitions. [2020-10-20 01:54:16,484 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 547 transitions. Word has length 60 [2020-10-20 01:54:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:16,484 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 547 transitions. [2020-10-20 01:54:16,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 547 transitions. [2020-10-20 01:54:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-20 01:54:16,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:16,486 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-10-20 01:54:16,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:54:16,486 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-10-20 01:54:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -69192917, now seen corresponding path program 1 times [2020-10-20 01:54:16,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:16,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478995607] [2020-10-20 01:54:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:16,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478995607] [2020-10-20 01:54:16,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:16,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:16,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808036236] [2020-10-20 01:54:16,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:16,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:16,543 INFO L87 Difference]: Start difference. First operand 393 states and 547 transitions. Second operand 3 states. [2020-10-20 01:54:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:16,615 INFO L93 Difference]: Finished difference Result 807 states and 1139 transitions. [2020-10-20 01:54:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:16,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-20 01:54:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:16,619 INFO L225 Difference]: With dead ends: 807 [2020-10-20 01:54:16,620 INFO L226 Difference]: Without dead ends: 529 [2020-10-20 01:54:16,620 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-10-20 01:54:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-20 01:54:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 381. [2020-10-20 01:54:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-10-20 01:54:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 529 transitions. [2020-10-20 01:54:16,641 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 529 transitions. Word has length 64 [2020-10-20 01:54:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:16,641 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 529 transitions. [2020-10-20 01:54:16,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 529 transitions. [2020-10-20 01:54:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 01:54:16,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:16,643 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-10-20 01:54:16,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:54:16,643 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-10-20 01:54:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1588224041, now seen corresponding path program 1 times [2020-10-20 01:54:16,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:16,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951456305] [2020-10-20 01:54:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:16,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951456305] [2020-10-20 01:54:16,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:16,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:16,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43179524] [2020-10-20 01:54:16,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:16,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:16,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:16,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:16,744 INFO L87 Difference]: Start difference. First operand 381 states and 529 transitions. Second operand 6 states. [2020-10-20 01:54:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:16,947 INFO L93 Difference]: Finished difference Result 1405 states and 1974 transitions. [2020-10-20 01:54:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:16,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-10-20 01:54:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:16,955 INFO L225 Difference]: With dead ends: 1405 [2020-10-20 01:54:16,955 INFO L226 Difference]: Without dead ends: 1139 [2020-10-20 01:54:16,957 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-10-20 01:54:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2020-10-20 01:54:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 402. [2020-10-20 01:54:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-20 01:54:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 553 transitions. [2020-10-20 01:54:16,996 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 553 transitions. Word has length 65 [2020-10-20 01:54:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:17,017 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 553 transitions. [2020-10-20 01:54:17,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 553 transitions. [2020-10-20 01:54:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-20 01:54:17,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:17,018 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-10-20 01:54:17,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:54:17,018 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-10-20 01:54:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1255523790, now seen corresponding path program 1 times [2020-10-20 01:54:17,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:17,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032356974] [2020-10-20 01:54:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:17,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032356974] [2020-10-20 01:54:17,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:17,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:17,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863897393] [2020-10-20 01:54:17,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:17,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:17,112 INFO L87 Difference]: Start difference. First operand 402 states and 553 transitions. Second operand 3 states. [2020-10-20 01:54:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:17,215 INFO L93 Difference]: Finished difference Result 824 states and 1155 transitions. [2020-10-20 01:54:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:17,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-10-20 01:54:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:17,220 INFO L225 Difference]: With dead ends: 824 [2020-10-20 01:54:17,220 INFO L226 Difference]: Without dead ends: 558 [2020-10-20 01:54:17,221 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-10-20 01:54:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-20 01:54:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2020-10-20 01:54:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-10-20 01:54:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 521 transitions. [2020-10-20 01:54:17,252 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 521 transitions. Word has length 67 [2020-10-20 01:54:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:17,253 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 521 transitions. [2020-10-20 01:54:17,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 521 transitions. [2020-10-20 01:54:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-20 01:54:17,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:17,255 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-10-20 01:54:17,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:54:17,255 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-10-20 01:54:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash -363592984, now seen corresponding path program 1 times [2020-10-20 01:54:17,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:17,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433120628] [2020-10-20 01:54:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:17,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433120628] [2020-10-20 01:54:17,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:17,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:17,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997018402] [2020-10-20 01:54:17,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:17,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:17,341 INFO L87 Difference]: Start difference. First operand 382 states and 521 transitions. Second operand 3 states. [2020-10-20 01:54:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:17,420 INFO L93 Difference]: Finished difference Result 792 states and 1099 transitions. [2020-10-20 01:54:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:17,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-10-20 01:54:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:17,424 INFO L225 Difference]: With dead ends: 792 [2020-10-20 01:54:17,424 INFO L226 Difference]: Without dead ends: 546 [2020-10-20 01:54:17,425 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-10-20 01:54:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-10-20 01:54:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 370. [2020-10-20 01:54:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-20 01:54:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 503 transitions. [2020-10-20 01:54:17,450 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 503 transitions. Word has length 71 [2020-10-20 01:54:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:17,450 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 503 transitions. [2020-10-20 01:54:17,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2020-10-20 01:54:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-20 01:54:17,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:17,451 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-10-20 01:54:17,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:54:17,452 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-10-20 01:54:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2014081046, now seen corresponding path program 1 times [2020-10-20 01:54:17,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:17,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292235758] [2020-10-20 01:54:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:17,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292235758] [2020-10-20 01:54:17,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:17,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:17,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635095872] [2020-10-20 01:54:17,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:17,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:17,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:17,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:17,679 INFO L87 Difference]: Start difference. First operand 370 states and 503 transitions. Second operand 6 states. [2020-10-20 01:54:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:17,926 INFO L93 Difference]: Finished difference Result 1057 states and 1464 transitions. [2020-10-20 01:54:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:17,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-10-20 01:54:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:17,932 INFO L225 Difference]: With dead ends: 1057 [2020-10-20 01:54:17,932 INFO L226 Difference]: Without dead ends: 823 [2020-10-20 01:54:17,933 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-10-20 01:54:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-10-20 01:54:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 395. [2020-10-20 01:54:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-20 01:54:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 538 transitions. [2020-10-20 01:54:17,966 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 538 transitions. Word has length 74 [2020-10-20 01:54:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:17,966 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 538 transitions. [2020-10-20 01:54:17,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 538 transitions. [2020-10-20 01:54:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-20 01:54:17,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:17,968 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-10-20 01:54:17,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:54:17,968 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-10-20 01:54:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1105027455, now seen corresponding path program 1 times [2020-10-20 01:54:17,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:17,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418015832] [2020-10-20 01:54:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:18,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418015832] [2020-10-20 01:54:18,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:18,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:18,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948110889] [2020-10-20 01:54:18,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:18,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:18,099 INFO L87 Difference]: Start difference. First operand 395 states and 538 transitions. Second operand 6 states. [2020-10-20 01:54:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:18,492 INFO L93 Difference]: Finished difference Result 1377 states and 1896 transitions. [2020-10-20 01:54:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:54:18,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-10-20 01:54:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:18,498 INFO L225 Difference]: With dead ends: 1377 [2020-10-20 01:54:18,498 INFO L226 Difference]: Without dead ends: 1125 [2020-10-20 01:54:18,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:54:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-10-20 01:54:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 423. [2020-10-20 01:54:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-20 01:54:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 569 transitions. [2020-10-20 01:54:18,538 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 569 transitions. Word has length 74 [2020-10-20 01:54:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:18,539 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 569 transitions. [2020-10-20 01:54:18,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 569 transitions. [2020-10-20 01:54:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-20 01:54:18,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:18,540 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-10-20 01:54:18,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:54:18,540 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-10-20 01:54:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1214147209, now seen corresponding path program 1 times [2020-10-20 01:54:18,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:18,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161837873] [2020-10-20 01:54:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:18,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161837873] [2020-10-20 01:54:18,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:18,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:18,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115396748] [2020-10-20 01:54:18,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:18,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:18,602 INFO L87 Difference]: Start difference. First operand 423 states and 569 transitions. Second operand 4 states. [2020-10-20 01:54:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:18,836 INFO L93 Difference]: Finished difference Result 1095 states and 1487 transitions. [2020-10-20 01:54:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:18,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-20 01:54:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:18,842 INFO L225 Difference]: With dead ends: 1095 [2020-10-20 01:54:18,843 INFO L226 Difference]: Without dead ends: 837 [2020-10-20 01:54:18,844 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-10-20 01:54:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-10-20 01:54:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 636. [2020-10-20 01:54:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-10-20 01:54:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 845 transitions. [2020-10-20 01:54:18,937 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 845 transitions. Word has length 74 [2020-10-20 01:54:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:18,937 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 845 transitions. [2020-10-20 01:54:18,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 845 transitions. [2020-10-20 01:54:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-20 01:54:18,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:18,941 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-10-20 01:54:18,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:54:18,942 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-10-20 01:54:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:18,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1739304111, now seen corresponding path program 1 times [2020-10-20 01:54:18,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:18,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438902848] [2020-10-20 01:54:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:19,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438902848] [2020-10-20 01:54:19,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:19,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:19,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448214149] [2020-10-20 01:54:19,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:19,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:19,054 INFO L87 Difference]: Start difference. First operand 636 states and 845 transitions. Second operand 3 states. [2020-10-20 01:54:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:19,150 INFO L93 Difference]: Finished difference Result 1115 states and 1511 transitions. [2020-10-20 01:54:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:19,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-20 01:54:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:19,155 INFO L225 Difference]: With dead ends: 1115 [2020-10-20 01:54:19,155 INFO L226 Difference]: Without dead ends: 746 [2020-10-20 01:54:19,157 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-10-20 01:54:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-10-20 01:54:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 632. [2020-10-20 01:54:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2020-10-20 01:54:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 838 transitions. [2020-10-20 01:54:19,231 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 838 transitions. Word has length 75 [2020-10-20 01:54:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:19,231 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 838 transitions. [2020-10-20 01:54:19,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 838 transitions. [2020-10-20 01:54:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:54:19,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:19,235 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-10-20 01:54:19,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:54:19,236 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-10-20 01:54:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -450501806, now seen corresponding path program 1 times [2020-10-20 01:54:19,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:19,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2846893] [2020-10-20 01:54:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:19,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2846893] [2020-10-20 01:54:19,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:19,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:19,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640265415] [2020-10-20 01:54:19,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:19,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:19,309 INFO L87 Difference]: Start difference. First operand 632 states and 838 transitions. Second operand 4 states. [2020-10-20 01:54:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:19,500 INFO L93 Difference]: Finished difference Result 1421 states and 1903 transitions. [2020-10-20 01:54:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:19,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-20 01:54:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:19,507 INFO L225 Difference]: With dead ends: 1421 [2020-10-20 01:54:19,507 INFO L226 Difference]: Without dead ends: 1042 [2020-10-20 01:54:19,509 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-10-20 01:54:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2020-10-20 01:54:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 843. [2020-10-20 01:54:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-10-20 01:54:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1108 transitions. [2020-10-20 01:54:19,608 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1108 transitions. Word has length 76 [2020-10-20 01:54:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:19,609 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1108 transitions. [2020-10-20 01:54:19,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1108 transitions. [2020-10-20 01:54:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:54:19,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:19,611 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-10-20 01:54:19,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:54:19,611 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-10-20 01:54:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1063318036, now seen corresponding path program 1 times [2020-10-20 01:54:19,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:19,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679765708] [2020-10-20 01:54:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:19,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679765708] [2020-10-20 01:54:19,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:19,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:19,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014006872] [2020-10-20 01:54:19,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:19,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:19,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:19,771 INFO L87 Difference]: Start difference. First operand 843 states and 1108 transitions. Second operand 6 states. [2020-10-20 01:54:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:20,328 INFO L93 Difference]: Finished difference Result 3156 states and 4193 transitions. [2020-10-20 01:54:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:54:20,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-10-20 01:54:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:20,341 INFO L225 Difference]: With dead ends: 3156 [2020-10-20 01:54:20,341 INFO L226 Difference]: Without dead ends: 2650 [2020-10-20 01:54:20,343 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-10-20 01:54:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-20 01:54:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 969. [2020-10-20 01:54:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-10-20 01:54:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1255 transitions. [2020-10-20 01:54:20,446 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1255 transitions. Word has length 76 [2020-10-20 01:54:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:20,446 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1255 transitions. [2020-10-20 01:54:20,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1255 transitions. [2020-10-20 01:54:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-20 01:54:20,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:20,448 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-10-20 01:54:20,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:54:20,449 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-10-20 01:54:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 412430714, now seen corresponding path program 1 times [2020-10-20 01:54:20,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:20,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483784751] [2020-10-20 01:54:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:20,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483784751] [2020-10-20 01:54:20,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:20,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:20,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551566850] [2020-10-20 01:54:20,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:20,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:20,511 INFO L87 Difference]: Start difference. First operand 969 states and 1255 transitions. Second operand 4 states. [2020-10-20 01:54:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:20,784 INFO L93 Difference]: Finished difference Result 2341 states and 3074 transitions. [2020-10-20 01:54:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:20,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-20 01:54:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:20,793 INFO L225 Difference]: With dead ends: 2341 [2020-10-20 01:54:20,793 INFO L226 Difference]: Without dead ends: 1787 [2020-10-20 01:54:20,795 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-10-20 01:54:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2020-10-20 01:54:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1310. [2020-10-20 01:54:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2020-10-20 01:54:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1690 transitions. [2020-10-20 01:54:20,904 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1690 transitions. Word has length 77 [2020-10-20 01:54:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:20,904 INFO L481 AbstractCegarLoop]: Abstraction has 1310 states and 1690 transitions. [2020-10-20 01:54:20,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1690 transitions. [2020-10-20 01:54:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-20 01:54:20,906 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:20,906 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-10-20 01:54:20,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:54:20,907 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-10-20 01:54:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 236706532, now seen corresponding path program 1 times [2020-10-20 01:54:20,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:20,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548537637] [2020-10-20 01:54:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:20,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-10-20 01:54:20,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548537637] [2020-10-20 01:54:20,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:20,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:20,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816452179] [2020-10-20 01:54:20,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:20,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:20,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:20,948 INFO L87 Difference]: Start difference. First operand 1310 states and 1690 transitions. Second operand 3 states. [2020-10-20 01:54:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:21,248 INFO L93 Difference]: Finished difference Result 3102 states and 4019 transitions. [2020-10-20 01:54:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-10-20 01:54:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:21,257 INFO L225 Difference]: With dead ends: 3102 [2020-10-20 01:54:21,257 INFO L226 Difference]: Without dead ends: 2154 [2020-10-20 01:54:21,259 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-10-20 01:54:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-20 01:54:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1312. [2020-10-20 01:54:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2020-10-20 01:54:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1692 transitions. [2020-10-20 01:54:21,368 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1692 transitions. Word has length 78 [2020-10-20 01:54:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:21,369 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1692 transitions. [2020-10-20 01:54:21,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1692 transitions. [2020-10-20 01:54:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-20 01:54:21,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:21,371 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-10-20 01:54:21,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:54:21,371 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-10-20 01:54:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1666890696, now seen corresponding path program 1 times [2020-10-20 01:54:21,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:21,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664836234] [2020-10-20 01:54:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:21,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664836234] [2020-10-20 01:54:21,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:21,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:21,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262489689] [2020-10-20 01:54:21,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:21,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:21,479 INFO L87 Difference]: Start difference. First operand 1312 states and 1692 transitions. Second operand 6 states. [2020-10-20 01:54:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:21,774 INFO L93 Difference]: Finished difference Result 2075 states and 2710 transitions. [2020-10-20 01:54:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:54:21,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-10-20 01:54:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:21,784 INFO L225 Difference]: With dead ends: 2075 [2020-10-20 01:54:21,784 INFO L226 Difference]: Without dead ends: 2073 [2020-10-20 01:54:21,786 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-10-20 01:54:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2020-10-20 01:54:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1314. [2020-10-20 01:54:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-10-20 01:54:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1694 transitions. [2020-10-20 01:54:21,930 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1694 transitions. Word has length 79 [2020-10-20 01:54:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:21,931 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1694 transitions. [2020-10-20 01:54:21,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1694 transitions. [2020-10-20 01:54:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-20 01:54:21,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:21,933 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-10-20 01:54:21,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:54:21,934 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-10-20 01:54:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -275805135, now seen corresponding path program 1 times [2020-10-20 01:54:21,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:21,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020680362] [2020-10-20 01:54:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:22,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-10-20 01:54:22,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020680362] [2020-10-20 01:54:22,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:22,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:22,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147185287] [2020-10-20 01:54:22,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:22,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:22,056 INFO L87 Difference]: Start difference. First operand 1314 states and 1694 transitions. Second operand 6 states. [2020-10-20 01:54:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:22,522 INFO L93 Difference]: Finished difference Result 3110 states and 4116 transitions. [2020-10-20 01:54:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:22,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-10-20 01:54:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:22,533 INFO L225 Difference]: With dead ends: 3110 [2020-10-20 01:54:22,533 INFO L226 Difference]: Without dead ends: 2316 [2020-10-20 01:54:22,536 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-10-20 01:54:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2020-10-20 01:54:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1314. [2020-10-20 01:54:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-10-20 01:54:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1682 transitions. [2020-10-20 01:54:22,705 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1682 transitions. Word has length 79 [2020-10-20 01:54:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:22,706 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1682 transitions. [2020-10-20 01:54:22,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1682 transitions. [2020-10-20 01:54:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-20 01:54:22,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:22,709 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-10-20 01:54:22,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:54:22,709 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-10-20 01:54:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1725608005, now seen corresponding path program 1 times [2020-10-20 01:54:22,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:22,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390390217] [2020-10-20 01:54:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:22,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390390217] [2020-10-20 01:54:22,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:22,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:22,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851735864] [2020-10-20 01:54:22,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:22,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:22,778 INFO L87 Difference]: Start difference. First operand 1314 states and 1682 transitions. Second operand 4 states. [2020-10-20 01:54:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:22,967 INFO L93 Difference]: Finished difference Result 2624 states and 3383 transitions. [2020-10-20 01:54:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:22,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-10-20 01:54:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:22,978 INFO L225 Difference]: With dead ends: 2624 [2020-10-20 01:54:22,978 INFO L226 Difference]: Without dead ends: 1382 [2020-10-20 01:54:22,982 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-10-20 01:54:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-10-20 01:54:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1026. [2020-10-20 01:54:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-10-20 01:54:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1326 transitions. [2020-10-20 01:54:23,168 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1326 transitions. Word has length 79 [2020-10-20 01:54:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:23,168 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1326 transitions. [2020-10-20 01:54:23,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1326 transitions. [2020-10-20 01:54:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-20 01:54:23,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:23,172 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-10-20 01:54:23,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:54:23,172 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-10-20 01:54:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1463168021, now seen corresponding path program 1 times [2020-10-20 01:54:23,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:23,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448627487] [2020-10-20 01:54:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:23,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-10-20 01:54:23,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448627487] [2020-10-20 01:54:23,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:23,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:23,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487219939] [2020-10-20 01:54:23,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:23,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:23,235 INFO L87 Difference]: Start difference. First operand 1026 states and 1326 transitions. Second operand 3 states. [2020-10-20 01:54:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:23,629 INFO L93 Difference]: Finished difference Result 2430 states and 3160 transitions. [2020-10-20 01:54:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:23,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-10-20 01:54:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:23,638 INFO L225 Difference]: With dead ends: 2430 [2020-10-20 01:54:23,639 INFO L226 Difference]: Without dead ends: 1548 [2020-10-20 01:54:23,641 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-10-20 01:54:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2020-10-20 01:54:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1032. [2020-10-20 01:54:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2020-10-20 01:54:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1332 transitions. [2020-10-20 01:54:23,823 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1332 transitions. Word has length 80 [2020-10-20 01:54:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:23,824 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1332 transitions. [2020-10-20 01:54:23,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1332 transitions. [2020-10-20 01:54:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-20 01:54:23,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:23,827 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-10-20 01:54:23,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:54:23,828 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-10-20 01:54:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1203231905, now seen corresponding path program 1 times [2020-10-20 01:54:23,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:23,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525941970] [2020-10-20 01:54:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:23,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525941970] [2020-10-20 01:54:23,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:23,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:23,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036254485] [2020-10-20 01:54:23,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:23,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:23,944 INFO L87 Difference]: Start difference. First operand 1032 states and 1332 transitions. Second operand 4 states. [2020-10-20 01:54:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:24,158 INFO L93 Difference]: Finished difference Result 2378 states and 3084 transitions. [2020-10-20 01:54:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:24,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-10-20 01:54:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:24,166 INFO L225 Difference]: With dead ends: 2378 [2020-10-20 01:54:24,166 INFO L226 Difference]: Without dead ends: 1442 [2020-10-20 01:54:24,168 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-10-20 01:54:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-10-20 01:54:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 974. [2020-10-20 01:54:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-10-20 01:54:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1252 transitions. [2020-10-20 01:54:24,309 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1252 transitions. Word has length 80 [2020-10-20 01:54:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:24,309 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 1252 transitions. [2020-10-20 01:54:24,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1252 transitions. [2020-10-20 01:54:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-20 01:54:24,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:24,311 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-10-20 01:54:24,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 01:54:24,312 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-10-20 01:54:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash -868242773, now seen corresponding path program 1 times [2020-10-20 01:54:24,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:24,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047279139] [2020-10-20 01:54:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:24,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047279139] [2020-10-20 01:54:24,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:24,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:24,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862676028] [2020-10-20 01:54:24,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:24,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:24,446 INFO L87 Difference]: Start difference. First operand 974 states and 1252 transitions. Second operand 6 states. [2020-10-20 01:54:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:25,195 INFO L93 Difference]: Finished difference Result 3193 states and 4270 transitions. [2020-10-20 01:54:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:25,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2020-10-20 01:54:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:25,203 INFO L225 Difference]: With dead ends: 3193 [2020-10-20 01:54:25,203 INFO L226 Difference]: Without dead ends: 2410 [2020-10-20 01:54:25,206 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-10-20 01:54:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-20 01:54:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 962. [2020-10-20 01:54:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2020-10-20 01:54:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1240 transitions. [2020-10-20 01:54:25,408 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1240 transitions. Word has length 82 [2020-10-20 01:54:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:25,409 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1240 transitions. [2020-10-20 01:54:25,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1240 transitions. [2020-10-20 01:54:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-20 01:54:25,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:25,412 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-10-20 01:54:25,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 01:54:25,412 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-10-20 01:54:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 528163420, now seen corresponding path program 1 times [2020-10-20 01:54:25,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:25,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852811632] [2020-10-20 01:54:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:25,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852811632] [2020-10-20 01:54:25,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:25,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:25,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477818151] [2020-10-20 01:54:25,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:25,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:25,553 INFO L87 Difference]: Start difference. First operand 962 states and 1240 transitions. Second operand 6 states. [2020-10-20 01:54:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:26,022 INFO L93 Difference]: Finished difference Result 2284 states and 3064 transitions. [2020-10-20 01:54:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:54:26,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-10-20 01:54:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:26,029 INFO L225 Difference]: With dead ends: 2284 [2020-10-20 01:54:26,029 INFO L226 Difference]: Without dead ends: 1501 [2020-10-20 01:54:26,031 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-10-20 01:54:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2020-10-20 01:54:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 968. [2020-10-20 01:54:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-10-20 01:54:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1246 transitions. [2020-10-20 01:54:26,194 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1246 transitions. Word has length 83 [2020-10-20 01:54:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:26,195 INFO L481 AbstractCegarLoop]: Abstraction has 968 states and 1246 transitions. [2020-10-20 01:54:26,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1246 transitions. [2020-10-20 01:54:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-20 01:54:26,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:26,199 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:26,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 01:54:26,199 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-10-20 01:54:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash -283747983, now seen corresponding path program 1 times [2020-10-20 01:54:26,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:26,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960068060] [2020-10-20 01:54:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:26,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960068060] [2020-10-20 01:54:26,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332669340] [2020-10-20 01:54:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 01:54:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:26,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:54:26,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:26,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:54:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:28,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:28,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-10-20 01:54:28,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475298055] [2020-10-20 01:54:28,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 01:54:28,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 01:54:28,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:54:28,313 INFO L87 Difference]: Start difference. First operand 968 states and 1246 transitions. Second operand 12 states. [2020-10-20 01:54:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:30,495 INFO L93 Difference]: Finished difference Result 4196 states and 5517 transitions. [2020-10-20 01:54:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 01:54:30,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2020-10-20 01:54:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:30,503 INFO L225 Difference]: With dead ends: 4196 [2020-10-20 01:54:30,504 INFO L226 Difference]: Without dead ends: 3413 [2020-10-20 01:54:30,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2020-10-20 01:54:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2020-10-20 01:54:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 1363. [2020-10-20 01:54:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2020-10-20 01:54:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1772 transitions. [2020-10-20 01:54:30,777 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1772 transitions. Word has length 132 [2020-10-20 01:54:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:30,778 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 1772 transitions. [2020-10-20 01:54:30,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 01:54:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1772 transitions. [2020-10-20 01:54:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-20 01:54:30,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:30,784 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:30,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-10-20 01:54:30,999 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-10-20 01:54:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1338189673, now seen corresponding path program 1 times [2020-10-20 01:54:30,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:31,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747130885] [2020-10-20 01:54:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:31,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747130885] [2020-10-20 01:54:31,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627888643] [2020-10-20 01:54:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 01:54:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:31,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 01:54:31,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-10-20 01:54:31,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:54:31,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-10-20 01:54:31,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726303725] [2020-10-20 01:54:31,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:31,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:54:31,708 INFO L87 Difference]: Start difference. First operand 1363 states and 1772 transitions. Second operand 4 states. [2020-10-20 01:54:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:32,141 INFO L93 Difference]: Finished difference Result 2589 states and 3384 transitions. [2020-10-20 01:54:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:54:32,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2020-10-20 01:54:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:32,147 INFO L225 Difference]: With dead ends: 2589 [2020-10-20 01:54:32,147 INFO L226 Difference]: Without dead ends: 1314 [2020-10-20 01:54:32,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:54:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2020-10-20 01:54:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2020-10-20 01:54:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-10-20 01:54:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1701 transitions. [2020-10-20 01:54:32,510 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1701 transitions. Word has length 132 [2020-10-20 01:54:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:32,511 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1701 transitions. [2020-10-20 01:54:32,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1701 transitions. [2020-10-20 01:54:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-20 01:54:32,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:32,518 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:32,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:32,731 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-10-20 01:54:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -29054437, now seen corresponding path program 1 times [2020-10-20 01:54:32,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:32,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4244927] [2020-10-20 01:54:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:33,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4244927] [2020-10-20 01:54:33,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264823154] [2020-10-20 01:54:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 01:54:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:33,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 01:54:33,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:33,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:54:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:33,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:33,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-10-20 01:54:33,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206164110] [2020-10-20 01:54:33,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 01:54:33,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 01:54:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:54:33,517 INFO L87 Difference]: Start difference. First operand 1314 states and 1701 transitions. Second operand 16 states. [2020-10-20 01:54:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:36,139 INFO L93 Difference]: Finished difference Result 3929 states and 5147 transitions. [2020-10-20 01:54:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-20 01:54:36,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 132 [2020-10-20 01:54:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:36,146 INFO L225 Difference]: With dead ends: 3929 [2020-10-20 01:54:36,147 INFO L226 Difference]: Without dead ends: 2819 [2020-10-20 01:54:36,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2020-10-20 01:54:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2020-10-20 01:54:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 1528. [2020-10-20 01:54:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2020-10-20 01:54:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1970 transitions. [2020-10-20 01:54:36,430 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1970 transitions. Word has length 132 [2020-10-20 01:54:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:36,430 INFO L481 AbstractCegarLoop]: Abstraction has 1528 states and 1970 transitions. [2020-10-20 01:54:36,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 01:54:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1970 transitions. [2020-10-20 01:54:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-20 01:54:36,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:36,435 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:36,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:36,649 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-10-20 01:54:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2124052381, now seen corresponding path program 1 times [2020-10-20 01:54:36,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:36,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862959966] [2020-10-20 01:54:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-20 01:54:36,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862959966] [2020-10-20 01:54:36,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:36,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:36,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460156043] [2020-10-20 01:54:36,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:36,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:36,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:36,755 INFO L87 Difference]: Start difference. First operand 1528 states and 1970 transitions. Second operand 5 states. [2020-10-20 01:54:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:37,197 INFO L93 Difference]: Finished difference Result 2802 states and 3652 transitions. [2020-10-20 01:54:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:37,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-10-20 01:54:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:37,203 INFO L225 Difference]: With dead ends: 2802 [2020-10-20 01:54:37,203 INFO L226 Difference]: Without dead ends: 1422 [2020-10-20 01:54:37,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-10-20 01:54:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2020-10-20 01:54:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2020-10-20 01:54:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1841 transitions. [2020-10-20 01:54:37,523 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1841 transitions. Word has length 132 [2020-10-20 01:54:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:37,523 INFO L481 AbstractCegarLoop]: Abstraction has 1422 states and 1841 transitions. [2020-10-20 01:54:37,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1841 transitions. [2020-10-20 01:54:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:54:37,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:37,528 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:37,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 01:54:37,528 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-10-20 01:54:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1824385361, now seen corresponding path program 1 times [2020-10-20 01:54:37,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:37,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100618259] [2020-10-20 01:54:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:37,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100618259] [2020-10-20 01:54:37,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787211997] [2020-10-20 01:54:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 01:54:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:38,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 01:54:38,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:38,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:54:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:38,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:38,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2020-10-20 01:54:38,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955105196] [2020-10-20 01:54:38,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 01:54:38,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 01:54:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:54:38,961 INFO L87 Difference]: Start difference. First operand 1422 states and 1841 transitions. Second operand 16 states. [2020-10-20 01:54:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:41,938 INFO L93 Difference]: Finished difference Result 4280 states and 5628 transitions. [2020-10-20 01:54:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-20 01:54:41,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2020-10-20 01:54:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:41,944 INFO L225 Difference]: With dead ends: 4280 [2020-10-20 01:54:41,945 INFO L226 Difference]: Without dead ends: 3082 [2020-10-20 01:54:41,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=1297, Unknown=0, NotChecked=0, Total=1640 [2020-10-20 01:54:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2020-10-20 01:54:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 1680. [2020-10-20 01:54:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2020-10-20 01:54:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2166 transitions. [2020-10-20 01:54:42,297 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2166 transitions. Word has length 133 [2020-10-20 01:54:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:42,298 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2166 transitions. [2020-10-20 01:54:42,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 01:54:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2166 transitions. [2020-10-20 01:54:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:54:42,302 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:42,302 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:42,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:42,519 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-10-20 01:54:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash 294833065, now seen corresponding path program 1 times [2020-10-20 01:54:42,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:42,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360004167] [2020-10-20 01:54:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:42,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360004167] [2020-10-20 01:54:42,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:42,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 01:54:42,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525410501] [2020-10-20 01:54:42,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:54:42,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:54:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:54:42,757 INFO L87 Difference]: Start difference. First operand 1680 states and 2166 transitions. Second operand 10 states. [2020-10-20 01:54:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:43,913 INFO L93 Difference]: Finished difference Result 4193 states and 5459 transitions. [2020-10-20 01:54:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 01:54:43,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2020-10-20 01:54:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:43,919 INFO L225 Difference]: With dead ends: 4193 [2020-10-20 01:54:43,919 INFO L226 Difference]: Without dead ends: 2798 [2020-10-20 01:54:43,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2020-10-20 01:54:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2020-10-20 01:54:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 1907. [2020-10-20 01:54:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-20 01:54:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2450 transitions. [2020-10-20 01:54:44,585 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2450 transitions. Word has length 133 [2020-10-20 01:54:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:44,585 INFO L481 AbstractCegarLoop]: Abstraction has 1907 states and 2450 transitions. [2020-10-20 01:54:44,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:54:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2450 transitions. [2020-10-20 01:54:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:54:44,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:44,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:44,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-20 01:54:44,590 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-10-20 01:54:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1325873963, now seen corresponding path program 1 times [2020-10-20 01:54:44,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:44,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782478659] [2020-10-20 01:54:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-20 01:54:44,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782478659] [2020-10-20 01:54:44,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:44,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:44,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670906662] [2020-10-20 01:54:44,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:44,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:44,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:44,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:44,708 INFO L87 Difference]: Start difference. First operand 1907 states and 2450 transitions. Second operand 5 states. [2020-10-20 01:54:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:45,229 INFO L93 Difference]: Finished difference Result 3441 states and 4480 transitions. [2020-10-20 01:54:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:45,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-10-20 01:54:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:45,233 INFO L225 Difference]: With dead ends: 3441 [2020-10-20 01:54:45,234 INFO L226 Difference]: Without dead ends: 1770 [2020-10-20 01:54:45,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-10-20 01:54:45,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2020-10-20 01:54:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2020-10-20 01:54:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2279 transitions. [2020-10-20 01:54:45,586 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2279 transitions. Word has length 133 [2020-10-20 01:54:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:45,586 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 2279 transitions. [2020-10-20 01:54:45,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2279 transitions. [2020-10-20 01:54:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:54:45,591 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:45,591 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:45,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-20 01:54:45,591 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-10-20 01:54:45,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1847300333, now seen corresponding path program 1 times [2020-10-20 01:54:45,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:45,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129523150] [2020-10-20 01:54:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-20 01:54:45,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129523150] [2020-10-20 01:54:45,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:45,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:45,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321868686] [2020-10-20 01:54:45,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:45,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:45,646 INFO L87 Difference]: Start difference. First operand 1770 states and 2279 transitions. Second operand 4 states. [2020-10-20 01:54:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:45,985 INFO L93 Difference]: Finished difference Result 3194 states and 4151 transitions. [2020-10-20 01:54:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:54:45,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-10-20 01:54:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:45,988 INFO L225 Difference]: With dead ends: 3194 [2020-10-20 01:54:45,988 INFO L226 Difference]: Without dead ends: 1572 [2020-10-20 01:54:45,990 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-10-20 01:54:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2020-10-20 01:54:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1567. [2020-10-20 01:54:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-10-20 01:54:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2018 transitions. [2020-10-20 01:54:46,199 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2018 transitions. Word has length 133 [2020-10-20 01:54:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:46,200 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2018 transitions. [2020-10-20 01:54:46,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2018 transitions. [2020-10-20 01:54:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-20 01:54:46,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:46,204 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:46,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-20 01:54:46,205 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-10-20 01:54:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -561196853, now seen corresponding path program 1 times [2020-10-20 01:54:46,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:46,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744451516] [2020-10-20 01:54:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-20 01:54:46,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744451516] [2020-10-20 01:54:46,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:46,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:46,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341902350] [2020-10-20 01:54:46,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:46,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:46,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:46,347 INFO L87 Difference]: Start difference. First operand 1567 states and 2018 transitions. Second operand 6 states. [2020-10-20 01:54:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:47,809 INFO L93 Difference]: Finished difference Result 8025 states and 10558 transitions. [2020-10-20 01:54:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 01:54:47,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2020-10-20 01:54:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:47,819 INFO L225 Difference]: With dead ends: 8025 [2020-10-20 01:54:47,819 INFO L226 Difference]: Without dead ends: 6682 [2020-10-20 01:54:47,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:54:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2020-10-20 01:54:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 2048. [2020-10-20 01:54:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2020-10-20 01:54:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2588 transitions. [2020-10-20 01:54:48,230 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2588 transitions. Word has length 134 [2020-10-20 01:54:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:48,230 INFO L481 AbstractCegarLoop]: Abstraction has 2048 states and 2588 transitions. [2020-10-20 01:54:48,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2588 transitions. [2020-10-20 01:54:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-20 01:54:48,237 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:48,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:48,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-20 01:54:48,238 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-10-20 01:54:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -373807391, now seen corresponding path program 1 times [2020-10-20 01:54:48,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:48,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325642676] [2020-10-20 01:54:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:48,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325642676] [2020-10-20 01:54:48,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910120204] [2020-10-20 01:54:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:48,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 01:54:48,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:48,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:48,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-20 01:54:48,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464125011] [2020-10-20 01:54:48,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 01:54:48,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 01:54:48,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:54:48,757 INFO L87 Difference]: Start difference. First operand 2048 states and 2588 transitions. Second operand 16 states. [2020-10-20 01:54:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:51,192 INFO L93 Difference]: Finished difference Result 7467 states and 9504 transitions. [2020-10-20 01:54:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-20 01:54:51,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 134 [2020-10-20 01:54:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:51,201 INFO L225 Difference]: With dead ends: 7467 [2020-10-20 01:54:51,201 INFO L226 Difference]: Without dead ends: 5643 [2020-10-20 01:54:51,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2020-10-20 01:54:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2020-10-20 01:54:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 2605. [2020-10-20 01:54:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2020-10-20 01:54:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3298 transitions. [2020-10-20 01:54:51,677 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3298 transitions. Word has length 134 [2020-10-20 01:54:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:51,677 INFO L481 AbstractCegarLoop]: Abstraction has 2605 states and 3298 transitions. [2020-10-20 01:54:51,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 01:54:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3298 transitions. [2020-10-20 01:54:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-20 01:54:51,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:51,680 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:51,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-10-20 01:54:51,882 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2014756639, now seen corresponding path program 1 times [2020-10-20 01:54:51,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:51,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281285171] [2020-10-20 01:54:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-20 01:54:51,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281285171] [2020-10-20 01:54:51,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:51,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:51,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991926053] [2020-10-20 01:54:51,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:51,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:51,956 INFO L87 Difference]: Start difference. First operand 2605 states and 3298 transitions. Second operand 4 states. [2020-10-20 01:54:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:52,707 INFO L93 Difference]: Finished difference Result 4783 states and 6098 transitions. [2020-10-20 01:54:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:54:52,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-10-20 01:54:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:52,711 INFO L225 Difference]: With dead ends: 4783 [2020-10-20 01:54:52,711 INFO L226 Difference]: Without dead ends: 2355 [2020-10-20 01:54:52,714 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-10-20 01:54:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2020-10-20 01:54:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2347. [2020-10-20 01:54:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2020-10-20 01:54:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 2966 transitions. [2020-10-20 01:54:53,084 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 2966 transitions. Word has length 134 [2020-10-20 01:54:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:53,084 INFO L481 AbstractCegarLoop]: Abstraction has 2347 states and 2966 transitions. [2020-10-20 01:54:53,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 2966 transitions. [2020-10-20 01:54:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-20 01:54:53,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:53,088 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:53,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-20 01:54:53,088 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1574718058, now seen corresponding path program 1 times [2020-10-20 01:54:53,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:53,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916499906] [2020-10-20 01:54:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:53,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916499906] [2020-10-20 01:54:53,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104117228] [2020-10-20 01:54:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:53,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 01:54:53,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:53,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 01:54:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:53,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:53,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-10-20 01:54:53,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782580805] [2020-10-20 01:54:53,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 01:54:53,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 01:54:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:54:53,638 INFO L87 Difference]: Start difference. First operand 2347 states and 2966 transitions. Second operand 15 states. [2020-10-20 01:54:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:55,304 INFO L93 Difference]: Finished difference Result 6322 states and 8040 transitions. [2020-10-20 01:54:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 01:54:55,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2020-10-20 01:54:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:55,308 INFO L225 Difference]: With dead ends: 6322 [2020-10-20 01:54:55,309 INFO L226 Difference]: Without dead ends: 4199 [2020-10-20 01:54:55,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2020-10-20 01:54:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2020-10-20 01:54:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 2422. [2020-10-20 01:54:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2020-10-20 01:54:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3072 transitions. [2020-10-20 01:54:55,704 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3072 transitions. Word has length 135 [2020-10-20 01:54:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:55,705 INFO L481 AbstractCegarLoop]: Abstraction has 2422 states and 3072 transitions. [2020-10-20 01:54:55,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 01:54:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3072 transitions. [2020-10-20 01:54:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-20 01:54:55,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:55,709 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:55,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-20 01:54:55,920 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1966947596, now seen corresponding path program 1 times [2020-10-20 01:54:55,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:55,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4111905] [2020-10-20 01:54:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:56,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4111905] [2020-10-20 01:54:56,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547504983] [2020-10-20 01:54:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:54:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:56,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 01:54:56,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:54:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:56,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:54:56,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 01:54:56,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491532878] [2020-10-20 01:54:56,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:54:56,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:54:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:54:56,465 INFO L87 Difference]: Start difference. First operand 2422 states and 3072 transitions. Second operand 7 states. [2020-10-20 01:54:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:59,597 INFO L93 Difference]: Finished difference Result 12547 states and 16281 transitions. [2020-10-20 01:54:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 01:54:59,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2020-10-20 01:54:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:59,605 INFO L225 Difference]: With dead ends: 12547 [2020-10-20 01:54:59,605 INFO L226 Difference]: Without dead ends: 10349 [2020-10-20 01:54:59,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-10-20 01:54:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10349 states. [2020-10-20 01:55:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10349 to 3213. [2020-10-20 01:55:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3213 states. [2020-10-20 01:55:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 4090 transitions. [2020-10-20 01:55:00,367 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 4090 transitions. Word has length 135 [2020-10-20 01:55:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:00,367 INFO L481 AbstractCegarLoop]: Abstraction has 3213 states and 4090 transitions. [2020-10-20 01:55:00,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:55:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 4090 transitions. [2020-10-20 01:55:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-20 01:55:00,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:00,372 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:00,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:00,583 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -118158588, now seen corresponding path program 1 times [2020-10-20 01:55:00,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:00,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188247023] [2020-10-20 01:55:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:00,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188247023] [2020-10-20 01:55:00,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305245959] [2020-10-20 01:55:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:01,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:55:01,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:55:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:01,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:55:01,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-20 01:55:01,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624808923] [2020-10-20 01:55:01,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 01:55:01,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:55:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 01:55:01,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:55:01,291 INFO L87 Difference]: Start difference. First operand 3213 states and 4090 transitions. Second operand 8 states. [2020-10-20 01:55:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:55:02,653 INFO L93 Difference]: Finished difference Result 7994 states and 10229 transitions. [2020-10-20 01:55:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 01:55:02,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2020-10-20 01:55:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:55:02,659 INFO L225 Difference]: With dead ends: 7994 [2020-10-20 01:55:02,659 INFO L226 Difference]: Without dead ends: 5005 [2020-10-20 01:55:02,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2020-10-20 01:55:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2020-10-20 01:55:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 3318. [2020-10-20 01:55:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2020-10-20 01:55:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4228 transitions. [2020-10-20 01:55:03,268 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4228 transitions. Word has length 135 [2020-10-20 01:55:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:03,269 INFO L481 AbstractCegarLoop]: Abstraction has 3318 states and 4228 transitions. [2020-10-20 01:55:03,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 01:55:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4228 transitions. [2020-10-20 01:55:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-20 01:55:03,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:03,272 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:03,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-10-20 01:55:03,473 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash 71147540, now seen corresponding path program 1 times [2020-10-20 01:55:03,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:03,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4653755] [2020-10-20 01:55:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:03,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4653755] [2020-10-20 01:55:03,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195978394] [2020-10-20 01:55:03,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:03,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 01:55:03,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:55:03,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 01:55:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:04,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:55:04,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2020-10-20 01:55:04,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781353291] [2020-10-20 01:55:04,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 01:55:04,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:55:04,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 01:55:04,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:55:04,099 INFO L87 Difference]: Start difference. First operand 3318 states and 4228 transitions. Second operand 15 states. [2020-10-20 01:55:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:55:06,565 INFO L93 Difference]: Finished difference Result 8280 states and 10562 transitions. [2020-10-20 01:55:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-20 01:55:06,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2020-10-20 01:55:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:55:06,570 INFO L225 Difference]: With dead ends: 8280 [2020-10-20 01:55:06,570 INFO L226 Difference]: Without dead ends: 5186 [2020-10-20 01:55:06,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 01:55:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2020-10-20 01:55:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3356. [2020-10-20 01:55:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2020-10-20 01:55:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4276 transitions. [2020-10-20 01:55:07,120 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4276 transitions. Word has length 136 [2020-10-20 01:55:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:07,122 INFO L481 AbstractCegarLoop]: Abstraction has 3356 states and 4276 transitions. [2020-10-20 01:55:07,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 01:55:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4276 transitions. [2020-10-20 01:55:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-20 01:55:07,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:07,125 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:07,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:07,326 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 469077670, now seen corresponding path program 1 times [2020-10-20 01:55:07,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:07,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146877300] [2020-10-20 01:55:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:07,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146877300] [2020-10-20 01:55:07,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277994603] [2020-10-20 01:55:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:55:07,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:55:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:07,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:55:07,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-20 01:55:07,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578382381] [2020-10-20 01:55:07,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 01:55:07,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:55:07,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 01:55:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:55:07,767 INFO L87 Difference]: Start difference. First operand 3356 states and 4276 transitions. Second operand 8 states. [2020-10-20 01:55:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:55:09,339 INFO L93 Difference]: Finished difference Result 8900 states and 11407 transitions. [2020-10-20 01:55:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 01:55:09,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-10-20 01:55:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:55:09,346 INFO L225 Difference]: With dead ends: 8900 [2020-10-20 01:55:09,346 INFO L226 Difference]: Without dead ends: 5768 [2020-10-20 01:55:09,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2020-10-20 01:55:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2020-10-20 01:55:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 3634. [2020-10-20 01:55:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2020-10-20 01:55:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4635 transitions. [2020-10-20 01:55:09,978 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4635 transitions. Word has length 136 [2020-10-20 01:55:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:09,978 INFO L481 AbstractCegarLoop]: Abstraction has 3634 states and 4635 transitions. [2020-10-20 01:55:09,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 01:55:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4635 transitions. [2020-10-20 01:55:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-20 01:55:09,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:09,981 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:10,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:10,188 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1058232064, now seen corresponding path program 1 times [2020-10-20 01:55:10,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:10,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115448275] [2020-10-20 01:55:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:10,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115448275] [2020-10-20 01:55:10,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452407759] [2020-10-20 01:55:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:55:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:10,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:55:10,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:55:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:55:10,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:55:10,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2020-10-20 01:55:10,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790599757] [2020-10-20 01:55:10,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 01:55:10,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:55:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 01:55:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 01:55:10,634 INFO L87 Difference]: Start difference. First operand 3634 states and 4635 transitions. Second operand 8 states. [2020-10-20 01:55:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:55:12,169 INFO L93 Difference]: Finished difference Result 8549 states and 10932 transitions. [2020-10-20 01:55:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 01:55:12,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-10-20 01:55:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:55:12,173 INFO L225 Difference]: With dead ends: 8549 [2020-10-20 01:55:12,174 INFO L226 Difference]: Without dead ends: 5139 [2020-10-20 01:55:12,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2020-10-20 01:55:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2020-10-20 01:55:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 3353. [2020-10-20 01:55:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2020-10-20 01:55:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4266 transitions. [2020-10-20 01:55:12,702 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4266 transitions. Word has length 136 [2020-10-20 01:55:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:12,702 INFO L481 AbstractCegarLoop]: Abstraction has 3353 states and 4266 transitions. [2020-10-20 01:55:12,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 01:55:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4266 transitions. [2020-10-20 01:55:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-20 01:55:12,704 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:12,705 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:12,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-10-20 01:55:12,913 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1237288015, now seen corresponding path program 1 times [2020-10-20 01:55:12,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:12,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743400352] [2020-10-20 01:55:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:55:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:55:13,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743400352] [2020-10-20 01:55:13,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:55:13,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:55:13,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774018173] [2020-10-20 01:55:13,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:55:13,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:55:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:55:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:55:13,071 INFO L87 Difference]: Start difference. First operand 3353 states and 4266 transitions. Second operand 6 states. [2020-10-20 01:55:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:55:14,146 INFO L93 Difference]: Finished difference Result 8578 states and 11082 transitions. [2020-10-20 01:55:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:55:14,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2020-10-20 01:55:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:55:14,151 INFO L225 Difference]: With dead ends: 8578 [2020-10-20 01:55:14,151 INFO L226 Difference]: Without dead ends: 5431 [2020-10-20 01:55:14,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:55:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2020-10-20 01:55:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3353. [2020-10-20 01:55:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2020-10-20 01:55:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4263 transitions. [2020-10-20 01:55:14,734 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4263 transitions. Word has length 137 [2020-10-20 01:55:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:55:14,735 INFO L481 AbstractCegarLoop]: Abstraction has 3353 states and 4263 transitions. [2020-10-20 01:55:14,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:55:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4263 transitions. [2020-10-20 01:55:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-10-20 01:55:14,737 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:55:14,737 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:55:14,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-20 01:55:14,737 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:55:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:55:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash -531708588, now seen corresponding path program 1 times [2020-10-20 01:55:14,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:55:14,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731827038] [2020-10-20 01:55:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:55:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:55:14,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:55:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:55:14,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:55:14,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:55:14,939 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:55:14,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-20 01:55:15,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:55:15 BoogieIcfgContainer [2020-10-20 01:55:15,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:55:15,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:55:15,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:55:15,166 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:55:15,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:13" (3/4) ... [2020-10-20 01:55:15,169 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:55:15,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:55:15,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:55:15,403 INFO L168 Benchmark]: Toolchain (without parser) took 63771.87 ms. Allocated memory was 43.0 MB in the beginning and 868.7 MB in the end (delta: 825.8 MB). Free memory was 24.6 MB in the beginning and 401.0 MB in the end (delta: -376.3 MB). Peak memory consumption was 449.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,404 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.84 ms. Allocated memory was 43.0 MB in the beginning and 47.2 MB in the end (delta: 4.2 MB). Free memory was 23.7 MB in the beginning and 20.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.86 ms. Allocated memory is still 47.2 MB. Free memory was 20.6 MB in the beginning and 15.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,405 INFO L168 Benchmark]: Boogie Preprocessor took 110.49 ms. Allocated memory is still 47.2 MB. Free memory was 15.4 MB in the beginning and 11.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,406 INFO L168 Benchmark]: RCFGBuilder took 1158.85 ms. Allocated memory was 47.2 MB in the beginning and 58.2 MB in the end (delta: 11.0 MB). Free memory was 11.4 MB in the beginning and 25.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,406 INFO L168 Benchmark]: TraceAbstraction took 61557.41 ms. Allocated memory was 58.2 MB in the beginning and 868.7 MB in the end (delta: 810.5 MB). Free memory was 25.2 MB in the beginning and 448.0 MB in the end (delta: -422.8 MB). Peak memory consumption was 387.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,407 INFO L168 Benchmark]: Witness Printer took 235.72 ms. Allocated memory is still 868.7 MB. Free memory was 448.0 MB in the beginning and 401.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:55:15,410 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.32 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 608.84 ms. Allocated memory was 43.0 MB in the beginning and 47.2 MB in the end (delta: 4.2 MB). Free memory was 23.7 MB in the beginning and 20.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 90.86 ms. Allocated memory is still 47.2 MB. Free memory was 20.6 MB in the beginning and 15.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 110.49 ms. Allocated memory is still 47.2 MB. Free memory was 15.4 MB in the beginning and 11.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1158.85 ms. Allocated memory was 47.2 MB in the beginning and 58.2 MB in the end (delta: 11.0 MB). Free memory was 11.4 MB in the beginning and 25.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 61557.41 ms. Allocated memory was 58.2 MB in the beginning and 868.7 MB in the end (delta: 810.5 MB). Free memory was 25.2 MB in the beginning and 448.0 MB in the end (delta: -422.8 MB). Peak memory consumption was 387.7 MB. Max. memory is 14.3 GB. * Witness Printer took 235.72 ms. Allocated memory is still 868.7 MB. Free memory was 448.0 MB in the beginning and 401.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 14.3 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: [L71] msg_t nomsg = (msg_t )-1; [L72] port_t cs1 ; [L73] int8_t cs1_old ; [L74] int8_t cs1_new ; [L75] port_t cs2 ; [L76] int8_t cs2_old ; [L77] int8_t cs2_new ; [L78] port_t s1s2 ; [L79] int8_t s1s2_old ; [L80] int8_t s1s2_new ; [L81] port_t s1s1 ; [L82] int8_t s1s1_old ; [L83] int8_t s1s1_new ; [L84] port_t s2s1 ; [L85] int8_t s2s1_old ; [L86] int8_t s2s1_new ; [L87] port_t s2s2 ; [L88] int8_t s2s2_old ; [L89] int8_t s2s2_new ; [L90] port_t s1p ; [L91] int8_t s1p_old ; [L92] int8_t s1p_new ; [L93] port_t s2p ; [L94] int8_t s2p_old ; [L95] int8_t s2p_new ; [L98] _Bool side1Failed ; [L99] _Bool side2Failed ; [L100] msg_t side1_written ; [L101] msg_t side2_written ; [L107] static _Bool side1Failed_History_0 ; [L108] static _Bool side1Failed_History_1 ; [L109] static _Bool side1Failed_History_2 ; [L110] static _Bool side2Failed_History_0 ; [L111] static _Bool side2Failed_History_1 ; [L112] static _Bool side2Failed_History_2 ; [L113] static int8_t active_side_History_0 ; [L114] static int8_t active_side_History_1 ; [L115] static int8_t active_side_History_2 ; [L116] static msg_t manual_selection_History_0 ; [L117] static msg_t manual_selection_History_1 ; [L118] static msg_t manual_selection_History_2 ; [L460] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; 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] [L582] int c1 ; [L583] int i2 ; [L586] c1 = 0 [L587] side1Failed = __VERIFIER_nondet_bool() [L588] side2Failed = __VERIFIER_nondet_bool() [L589] side1_written = __VERIFIER_nondet_char() [L590] side2_written = __VERIFIER_nondet_char() [L591] side1Failed_History_0 = __VERIFIER_nondet_bool() [L592] side1Failed_History_1 = __VERIFIER_nondet_bool() [L593] side1Failed_History_2 = __VERIFIER_nondet_bool() [L594] side2Failed_History_0 = __VERIFIER_nondet_bool() [L595] side2Failed_History_1 = __VERIFIER_nondet_bool() [L596] side2Failed_History_2 = __VERIFIER_nondet_bool() [L597] active_side_History_0 = __VERIFIER_nondet_char() [L598] active_side_History_1 = __VERIFIER_nondet_char() [L599] active_side_History_2 = __VERIFIER_nondet_char() [L600] manual_selection_History_0 = __VERIFIER_nondet_char() [L601] manual_selection_History_1 = __VERIFIER_nondet_char() [L602] manual_selection_History_2 = __VERIFIER_nondet_char() [L244] 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] [L247] 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] [L250] 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] [L253] 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] [L256] 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] [L259] 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] [L262] 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] [L265] 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] [L268] 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] [L271] 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] [L274] 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] [L277] COND FALSE !((int )manual_selection_History_2 != 0) [L280] 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] [L603] i2 = init() [L105] 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] [L605] cs1_old = nomsg [L606] cs1_new = nomsg [L607] cs2_old = nomsg [L608] cs2_new = nomsg [L609] s1s2_old = nomsg [L610] s1s2_new = nomsg [L611] s1s1_old = nomsg [L612] s1s1_new = nomsg [L613] s2s1_old = nomsg [L614] s2s1_new = nomsg [L615] s2s2_old = nomsg [L616] s2s2_new = nomsg [L617] s1p_old = nomsg [L618] s1p_new = nomsg [L619] s2p_old = nomsg [L620] s2p_new = nomsg [L621] 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] [L622] COND TRUE 1 [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] manual_selection = tmp [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] 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=-4, 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] [L305] 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=-4, 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] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-4, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-4, 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] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L324] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L325] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L325] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L326] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L326] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L327] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L327] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L328] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L381] COND FALSE !(\read(side2Failed)) [L388] side1 = s1s2_old [L389] s1s2_old = nomsg [L390] side2 = s2s2_old [L391] s2s2_old = nomsg [L392] manual_selection = cs2_old [L393] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L394] COND TRUE (int )side1 == (int )side2 [L395] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L418] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L418] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L419] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L419] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L420] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L420] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L421] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] int8_t side2 ; [L195] COND TRUE (int )index == 0 [L196] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L441] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L444] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L447] COND FALSE !((int )side1 == 0) [L454] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, 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] [L628] cs1_old = cs1_new [L629] cs1_new = nomsg [L630] cs2_old = cs2_new [L631] cs2_new = nomsg [L632] s1s2_old = s1s2_new [L633] s1s2_new = nomsg [L634] s1s1_old = s1s1_new [L635] s1s1_new = nomsg [L636] s2s1_old = s2s1_new [L637] s2s1_new = nomsg [L638] s2s2_old = s2s2_new [L639] s2s2_new = nomsg [L640] s1p_old = s1p_new [L641] s1p_new = nomsg [L642] s2p_old = s2p_new [L643] s2p_new = nomsg [L463] int tmp ; [L464] msg_t tmp___0 ; [L465] _Bool tmp___1 ; [L466] _Bool tmp___2 ; [L467] _Bool tmp___3 ; [L468] _Bool tmp___4 ; [L469] int8_t tmp___5 ; [L470] _Bool tmp___6 ; [L471] _Bool tmp___7 ; [L472] _Bool tmp___8 ; [L473] int8_t tmp___9 ; [L474] _Bool tmp___10 ; [L475] _Bool tmp___11 ; [L476] _Bool tmp___12 ; [L477] msg_t tmp___13 ; [L478] _Bool tmp___14 ; [L479] _Bool tmp___15 ; [L480] _Bool tmp___16 ; [L481] _Bool tmp___17 ; [L482] int8_t tmp___18 ; [L483] int8_t tmp___19 ; [L484] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L487] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L490] COND TRUE ! side2Failed [L491] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L105] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L225] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L228] COND TRUE (int )index == 1 [L229] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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___0 = read_manual_selection_history((unsigned char)1) [L497] COND TRUE ! tmp___0 [L135] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L498] tmp___1 = read_side1_failed_history((unsigned char)1) [L499] COND TRUE ! tmp___1 [L135] COND TRUE (int )index == 0 [L136] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L500] tmp___2 = read_side1_failed_history((unsigned char)0) [L501] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L135] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L526] tmp___7 = read_side1_failed_history((unsigned char)1) [L527] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L135] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L542] tmp___11 = read_side1_failed_history((unsigned char)1) [L543] COND TRUE ! tmp___11 [L165] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L168] COND TRUE (int )index == 1 [L169] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L544] tmp___12 = read_side2_failed_history((unsigned char)1) [L545] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L195] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L198] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L201] COND TRUE (int )index == 2 [L202] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L558] tmp___20 = read_active_side_history((unsigned char)2) [L559] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L577] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L644] c1 = check() [L656] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, 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] [L622] COND TRUE 1 [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] manual_selection = tmp [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L305] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-128, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-128, cs1_old=-4, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-4, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L324] COND FALSE !(\read(side1Failed)) [L331] side1 = s1s1_old [L332] s1s1_old = nomsg [L333] side2 = s2s1_old [L334] s2s1_old = nomsg [L335] manual_selection = cs1_old [L336] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L337] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L340] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L341] COND TRUE (int )side2 != (int )nomsg [L342] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L361] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L361] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L362] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L362] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L363] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L363] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L364] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L381] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L382] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L382] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L383] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L383] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L384] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L384] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L385] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] int8_t side2 ; [L195] COND TRUE (int )index == 0 [L196] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L441] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L444] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L447] COND FALSE !((int )side1 == 0) [L454] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-4, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L628] cs1_old = cs1_new [L629] cs1_new = nomsg [L630] cs2_old = cs2_new [L631] cs2_new = nomsg [L632] s1s2_old = s1s2_new [L633] s1s2_new = nomsg [L634] s1s1_old = s1s1_new [L635] s1s1_new = nomsg [L636] s2s1_old = s2s1_new [L637] s2s1_new = nomsg [L638] s2s2_old = s2s2_new [L639] s2s2_new = nomsg [L640] s1p_old = s1p_new [L641] s1p_new = nomsg [L642] s2p_old = s2p_new [L643] s2p_new = nomsg [L463] int tmp ; [L464] msg_t tmp___0 ; [L465] _Bool tmp___1 ; [L466] _Bool tmp___2 ; [L467] _Bool tmp___3 ; [L468] _Bool tmp___4 ; [L469] int8_t tmp___5 ; [L470] _Bool tmp___6 ; [L471] _Bool tmp___7 ; [L472] _Bool tmp___8 ; [L473] int8_t tmp___9 ; [L474] _Bool tmp___10 ; [L475] _Bool tmp___11 ; [L476] _Bool tmp___12 ; [L477] msg_t tmp___13 ; [L478] _Bool tmp___14 ; [L479] _Bool tmp___15 ; [L480] _Bool tmp___16 ; [L481] _Bool tmp___17 ; [L482] int8_t tmp___18 ; [L483] int8_t tmp___19 ; [L484] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L487] COND TRUE ! side1Failed [L488] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L105] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L225] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L228] COND TRUE (int )index == 1 [L229] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L496] tmp___0 = read_manual_selection_history((unsigned char)1) [L497] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L135] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L526] tmp___7 = read_side1_failed_history((unsigned char)1) [L527] COND TRUE \read(tmp___7) [L165] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L168] COND TRUE (int )index == 1 [L169] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L528] tmp___8 = read_side2_failed_history((unsigned char)1) [L529] COND TRUE ! tmp___8 [L195] COND TRUE (int )index == 0 [L196] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L530] tmp___5 = read_active_side_history((unsigned char)0) [L531] COND TRUE ! ((int )tmp___5 == 2) [L532] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, 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] [L644] c1 = check() [L656] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 317 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 61.2s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22208 SDtfs, 35769 SDslu, 74002 SDs, 0 SdLazy, 12219 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2019 GetRequests, 1544 SyntacticMatches, 15 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3634occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 44007 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 5904 NumberOfCodeBlocks, 5904 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5706 ConstructedInterpolants, 136 QuantifiedInterpolants, 4075826 SizeOfPredicates, 44 NumberOfNonLiveVariables, 8712 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 57 InterpolantComputations, 39 PerfectInterpolantSequences, 835/1063 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...