./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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.5.800.v20200727-1323.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/locks/test_locks_13.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 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:39:00,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:39:00,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:39:00,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:39:00,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:39:00,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:39:00,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:39:00,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:39:00,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:39:00,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:39:00,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:39:00,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:39:00,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:39:00,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:39:00,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:39:00,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:39:00,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:39:00,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:39:00,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:39:00,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:39:00,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:39:00,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:39:00,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:39:00,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:39:00,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:39:00,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:39:00,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:39:00,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:39:00,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:39:00,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:39:00,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:39:00,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:39:00,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:39:00,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:39:00,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:39:00,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:39:00,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:39:00,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:39:00,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:39:00,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:39:00,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:39:00,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:39:00,609 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:39:00,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:39:00,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:39:00,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:39:00,614 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:39:00,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:39:00,615 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:39:00,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:39:00,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:39:00,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:39:00,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:39:00,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:39:00,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:39:00,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:39:00,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:39:00,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:39:00,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:39:00,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:39:00,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:39:00,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:39:00,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:39:00,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:39:00,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:39:00,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:39:00,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:39:00,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:39:00,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:39:00,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:39:00,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:39:00,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2020-10-25 19:39:01,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:39:01,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:39:01,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:39:01,129 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:39:01,130 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:39:01,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2020-10-25 19:39:01,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea11d478/ad330c89895f4b7d9223642271ebfff3/FLAG8abace7a5 [2020-10-25 19:39:01,835 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:39:01,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2020-10-25 19:39:01,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea11d478/ad330c89895f4b7d9223642271ebfff3/FLAG8abace7a5 [2020-10-25 19:39:02,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea11d478/ad330c89895f4b7d9223642271ebfff3 [2020-10-25 19:39:02,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:39:02,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:39:02,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:39:02,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:39:02,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:39:02,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d4701a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02, skipping insertion in model container [2020-10-25 19:39:02,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:39:02,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:39:02,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:39:02,539 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:39:02,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:39:02,586 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:39:02,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02 WrapperNode [2020-10-25 19:39:02,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:39:02,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:39:02,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:39:02,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:39:02,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:39:02,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:39:02,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:39:02,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:39:02,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:39:02,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:39:02,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:39:02,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:39:02,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (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-25 19:39:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:39:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:39:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:39:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:39:03,206 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:39:03,207 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-25 19:39:03,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:03 BoogieIcfgContainer [2020-10-25 19:39:03,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:39:03,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:39:03,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:39:03,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:39:03,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:39:02" (1/3) ... [2020-10-25 19:39:03,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9f3f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:39:03, skipping insertion in model container [2020-10-25 19:39:03,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (2/3) ... [2020-10-25 19:39:03,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9f3f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:39:03, skipping insertion in model container [2020-10-25 19:39:03,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:03" (3/3) ... [2020-10-25 19:39:03,220 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2020-10-25 19:39:03,236 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:39:03,241 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:39:03,270 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:39:03,301 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:39:03,302 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:39:03,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:39:03,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:39:03,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:39:03,303 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:39:03,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:39:03,303 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:39:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-10-25 19:39:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 19:39:03,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,331 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] [2020-10-25 19:39:03,332 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2020-10-25 19:39:03,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840805633] [2020-10-25 19:39:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,615 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-25 19:39:03,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840805633] [2020-10-25 19:39:03,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603424159] [2020-10-25 19:39:03,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,645 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-10-25 19:39:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,705 INFO L93 Difference]: Finished difference Result 102 states and 182 transitions. [2020-10-25 19:39:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-25 19:39:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,722 INFO L225 Difference]: With dead ends: 102 [2020-10-25 19:39:03,722 INFO L226 Difference]: Without dead ends: 87 [2020-10-25 19:39:03,726 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-25 19:39:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-25 19:39:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2020-10-25 19:39:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-25 19:39:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2020-10-25 19:39:03,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2020-10-25 19:39:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,808 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2020-10-25 19:39:03,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2020-10-25 19:39:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 19:39:03,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,812 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] [2020-10-25 19:39:03,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:39:03,814 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2020-10-25 19:39:03,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886426260] [2020-10-25 19:39:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,963 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-25 19:39:03,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886426260] [2020-10-25 19:39:03,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655084784] [2020-10-25 19:39:03,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,968 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand 3 states. [2020-10-25 19:39:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,998 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2020-10-25 19:39:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-25 19:39:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,001 INFO L225 Difference]: With dead ends: 144 [2020-10-25 19:39:04,001 INFO L226 Difference]: Without dead ends: 87 [2020-10-25 19:39:04,002 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-25 19:39:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-25 19:39:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2020-10-25 19:39:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-25 19:39:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2020-10-25 19:39:04,014 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2020-10-25 19:39:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,014 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2020-10-25 19:39:04,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2020-10-25 19:39:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:04,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,016 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] [2020-10-25 19:39:04,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:39:04,016 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2020-10-25 19:39:04,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533521777] [2020-10-25 19:39:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,106 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-25 19:39:04,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533521777] [2020-10-25 19:39:04,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698154677] [2020-10-25 19:39:04,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,111 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand 3 states. [2020-10-25 19:39:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,170 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2020-10-25 19:39:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,175 INFO L225 Difference]: With dead ends: 132 [2020-10-25 19:39:04,175 INFO L226 Difference]: Without dead ends: 90 [2020-10-25 19:39:04,176 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-25 19:39:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-25 19:39:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2020-10-25 19:39:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-25 19:39:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2020-10-25 19:39:04,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2020-10-25 19:39:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,191 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2020-10-25 19:39:04,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2020-10-25 19:39:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:04,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,192 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] [2020-10-25 19:39:04,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:39:04,193 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2020-10-25 19:39:04,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387260497] [2020-10-25 19:39:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,246 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-25 19:39:04,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387260497] [2020-10-25 19:39:04,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16942833] [2020-10-25 19:39:04,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,250 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand 3 states. [2020-10-25 19:39:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,283 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2020-10-25 19:39:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,287 INFO L225 Difference]: With dead ends: 169 [2020-10-25 19:39:04,287 INFO L226 Difference]: Without dead ends: 167 [2020-10-25 19:39:04,288 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-25 19:39:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-10-25 19:39:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2020-10-25 19:39:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-25 19:39:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2020-10-25 19:39:04,301 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2020-10-25 19:39:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,302 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2020-10-25 19:39:04,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2020-10-25 19:39:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:04,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,304 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] [2020-10-25 19:39:04,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:39:04,305 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2020-10-25 19:39:04,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972795633] [2020-10-25 19:39:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,347 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-25 19:39:04,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972795633] [2020-10-25 19:39:04,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554680344] [2020-10-25 19:39:04,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,351 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand 3 states. [2020-10-25 19:39:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,374 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2020-10-25 19:39:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,377 INFO L225 Difference]: With dead ends: 281 [2020-10-25 19:39:04,377 INFO L226 Difference]: Without dead ends: 169 [2020-10-25 19:39:04,380 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-25 19:39:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-25 19:39:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2020-10-25 19:39:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-25 19:39:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2020-10-25 19:39:04,410 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2020-10-25 19:39:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,411 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2020-10-25 19:39:04,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2020-10-25 19:39:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 19:39:04,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,414 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] [2020-10-25 19:39:04,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:39:04,414 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2020-10-25 19:39:04,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064957371] [2020-10-25 19:39:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,492 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-25 19:39:04,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064957371] [2020-10-25 19:39:04,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168144672] [2020-10-25 19:39:04,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,497 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand 3 states. [2020-10-25 19:39:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,519 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2020-10-25 19:39:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 19:39:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,521 INFO L225 Difference]: With dead ends: 252 [2020-10-25 19:39:04,521 INFO L226 Difference]: Without dead ends: 171 [2020-10-25 19:39:04,523 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-25 19:39:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-25 19:39:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2020-10-25 19:39:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-10-25 19:39:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2020-10-25 19:39:04,542 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2020-10-25 19:39:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,542 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2020-10-25 19:39:04,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2020-10-25 19:39:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 19:39:04,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,550 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] [2020-10-25 19:39:04,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:39:04,550 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2020-10-25 19:39:04,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440833794] [2020-10-25 19:39:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,584 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-25 19:39:04,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440833794] [2020-10-25 19:39:04,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694094807] [2020-10-25 19:39:04,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,587 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand 3 states. [2020-10-25 19:39:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,611 INFO L93 Difference]: Finished difference Result 489 states and 881 transitions. [2020-10-25 19:39:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 19:39:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,614 INFO L225 Difference]: With dead ends: 489 [2020-10-25 19:39:04,614 INFO L226 Difference]: Without dead ends: 327 [2020-10-25 19:39:04,615 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-25 19:39:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-10-25 19:39:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2020-10-25 19:39:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-10-25 19:39:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2020-10-25 19:39:04,630 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2020-10-25 19:39:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,630 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2020-10-25 19:39:04,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2020-10-25 19:39:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 19:39:04,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,633 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] [2020-10-25 19:39:04,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:39:04,633 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2020-10-25 19:39:04,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011707471] [2020-10-25 19:39:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,668 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-25 19:39:04,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011707471] [2020-10-25 19:39:04,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429547394] [2020-10-25 19:39:04,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,673 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand 3 states. [2020-10-25 19:39:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,705 INFO L93 Difference]: Finished difference Result 417 states and 749 transitions. [2020-10-25 19:39:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 19:39:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,709 INFO L225 Difference]: With dead ends: 417 [2020-10-25 19:39:04,709 INFO L226 Difference]: Without dead ends: 415 [2020-10-25 19:39:04,711 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-25 19:39:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-25 19:39:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2020-10-25 19:39:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-10-25 19:39:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2020-10-25 19:39:04,731 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2020-10-25 19:39:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,733 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2020-10-25 19:39:04,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2020-10-25 19:39:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:39:04,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,738 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] [2020-10-25 19:39:04,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:39:04,739 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2020-10-25 19:39:04,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119875455] [2020-10-25 19:39:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,793 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-25 19:39:04,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119875455] [2020-10-25 19:39:04,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141989608] [2020-10-25 19:39:04,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,795 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand 3 states. [2020-10-25 19:39:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,818 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2020-10-25 19:39:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 19:39:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,822 INFO L225 Difference]: With dead ends: 613 [2020-10-25 19:39:04,822 INFO L226 Difference]: Without dead ends: 611 [2020-10-25 19:39:04,823 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-25 19:39:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-10-25 19:39:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2020-10-25 19:39:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-10-25 19:39:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2020-10-25 19:39:04,839 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2020-10-25 19:39:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,839 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2020-10-25 19:39:04,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2020-10-25 19:39:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:39:04,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:04,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:39:04,841 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2020-10-25 19:39:04,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738284651] [2020-10-25 19:39:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,869 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-25 19:39:04,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738284651] [2020-10-25 19:39:04,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427638908] [2020-10-25 19:39:04,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,872 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand 3 states. [2020-10-25 19:39:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,902 INFO L93 Difference]: Finished difference Result 1077 states and 1889 transitions. [2020-10-25 19:39:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 19:39:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,906 INFO L225 Difference]: With dead ends: 1077 [2020-10-25 19:39:04,907 INFO L226 Difference]: Without dead ends: 635 [2020-10-25 19:39:04,908 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-25 19:39:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-10-25 19:39:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2020-10-25 19:39:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-25 19:39:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2020-10-25 19:39:04,928 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2020-10-25 19:39:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,928 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2020-10-25 19:39:04,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2020-10-25 19:39:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:04,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,930 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] [2020-10-25 19:39:04,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:39:04,931 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2020-10-25 19:39:04,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54138995] [2020-10-25 19:39:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,973 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-25 19:39:04,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54138995] [2020-10-25 19:39:04,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401354834] [2020-10-25 19:39:04,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,975 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand 3 states. [2020-10-25 19:39:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,997 INFO L93 Difference]: Finished difference Result 957 states and 1657 transitions. [2020-10-25 19:39:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,002 INFO L225 Difference]: With dead ends: 957 [2020-10-25 19:39:05,002 INFO L226 Difference]: Without dead ends: 647 [2020-10-25 19:39:05,003 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-25 19:39:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-10-25 19:39:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2020-10-25 19:39:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-10-25 19:39:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2020-10-25 19:39:05,024 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2020-10-25 19:39:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,024 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2020-10-25 19:39:05,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2020-10-25 19:39:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:05,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,027 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] [2020-10-25 19:39:05,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:39:05,028 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2020-10-25 19:39:05,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048544359] [2020-10-25 19:39:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,066 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-25 19:39:05,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048544359] [2020-10-25 19:39:05,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745622163] [2020-10-25 19:39:05,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,068 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand 3 states. [2020-10-25 19:39:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,095 INFO L93 Difference]: Finished difference Result 1193 states and 2077 transitions. [2020-10-25 19:39:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,102 INFO L225 Difference]: With dead ends: 1193 [2020-10-25 19:39:05,103 INFO L226 Difference]: Without dead ends: 1191 [2020-10-25 19:39:05,103 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-25 19:39:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-10-25 19:39:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2020-10-25 19:39:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2020-10-25 19:39:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2020-10-25 19:39:05,156 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2020-10-25 19:39:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,157 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2020-10-25 19:39:05,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2020-10-25 19:39:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:05,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,161 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] [2020-10-25 19:39:05,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:39:05,161 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2020-10-25 19:39:05,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646047281] [2020-10-25 19:39:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,224 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-25 19:39:05,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646047281] [2020-10-25 19:39:05,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185568624] [2020-10-25 19:39:05,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,227 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand 3 states. [2020-10-25 19:39:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,278 INFO L93 Difference]: Finished difference Result 2137 states and 3613 transitions. [2020-10-25 19:39:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,292 INFO L225 Difference]: With dead ends: 2137 [2020-10-25 19:39:05,292 INFO L226 Difference]: Without dead ends: 1255 [2020-10-25 19:39:05,294 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-25 19:39:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-10-25 19:39:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2020-10-25 19:39:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2020-10-25 19:39:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2020-10-25 19:39:05,329 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2020-10-25 19:39:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,330 INFO L481 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2020-10-25 19:39:05,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2020-10-25 19:39:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,335 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] [2020-10-25 19:39:05,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:39:05,335 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2020-10-25 19:39:05,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067953697] [2020-10-25 19:39:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,373 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-25 19:39:05,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067953697] [2020-10-25 19:39:05,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135522682] [2020-10-25 19:39:05,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,376 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand 3 states. [2020-10-25 19:39:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,410 INFO L93 Difference]: Finished difference Result 1881 states and 3141 transitions. [2020-10-25 19:39:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,418 INFO L225 Difference]: With dead ends: 1881 [2020-10-25 19:39:05,418 INFO L226 Difference]: Without dead ends: 1271 [2020-10-25 19:39:05,419 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-25 19:39:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2020-10-25 19:39:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2020-10-25 19:39:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2020-10-25 19:39:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2020-10-25 19:39:05,462 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2020-10-25 19:39:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,462 INFO L481 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2020-10-25 19:39:05,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2020-10-25 19:39:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,464 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] [2020-10-25 19:39:05,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:39:05,465 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2020-10-25 19:39:05,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008325675] [2020-10-25 19:39:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,492 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-25 19:39:05,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008325675] [2020-10-25 19:39:05,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305806599] [2020-10-25 19:39:05,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,495 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand 3 states. [2020-10-25 19:39:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,528 INFO L93 Difference]: Finished difference Result 2313 states and 3893 transitions. [2020-10-25 19:39:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,541 INFO L225 Difference]: With dead ends: 2313 [2020-10-25 19:39:05,541 INFO L226 Difference]: Without dead ends: 2311 [2020-10-25 19:39:05,543 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-25 19:39:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2020-10-25 19:39:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2020-10-25 19:39:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2020-10-25 19:39:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2020-10-25 19:39:05,604 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2020-10-25 19:39:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,605 INFO L481 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2020-10-25 19:39:05,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2020-10-25 19:39:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,609 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] [2020-10-25 19:39:05,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:39:05,609 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2020-10-25 19:39:05,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675247848] [2020-10-25 19:39:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,650 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-25 19:39:05,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675247848] [2020-10-25 19:39:05,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727575861] [2020-10-25 19:39:05,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,653 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand 3 states. [2020-10-25 19:39:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,702 INFO L93 Difference]: Finished difference Result 4233 states and 6869 transitions. [2020-10-25 19:39:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,716 INFO L225 Difference]: With dead ends: 4233 [2020-10-25 19:39:05,717 INFO L226 Difference]: Without dead ends: 2471 [2020-10-25 19:39:05,720 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-25 19:39:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2020-10-25 19:39:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2020-10-25 19:39:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2020-10-25 19:39:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2020-10-25 19:39:05,816 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2020-10-25 19:39:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,816 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2020-10-25 19:39:05,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2020-10-25 19:39:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:05,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,821 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] [2020-10-25 19:39:05,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:39:05,822 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2020-10-25 19:39:05,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182570713] [2020-10-25 19:39:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,870 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-25 19:39:05,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182570713] [2020-10-25 19:39:05,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151677343] [2020-10-25 19:39:05,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,876 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand 3 states. [2020-10-25 19:39:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,925 INFO L93 Difference]: Finished difference Result 3705 states and 5941 transitions. [2020-10-25 19:39:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,939 INFO L225 Difference]: With dead ends: 3705 [2020-10-25 19:39:05,940 INFO L226 Difference]: Without dead ends: 2503 [2020-10-25 19:39:05,942 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-25 19:39:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2020-10-25 19:39:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2020-10-25 19:39:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2501 states. [2020-10-25 19:39:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2020-10-25 19:39:06,039 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2020-10-25 19:39:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,040 INFO L481 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2020-10-25 19:39:06,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2020-10-25 19:39:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:06,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,044 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] [2020-10-25 19:39:06,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:39:06,045 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2020-10-25 19:39:06,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658228891] [2020-10-25 19:39:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,078 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-25 19:39:06,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658228891] [2020-10-25 19:39:06,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806589608] [2020-10-25 19:39:06,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,080 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand 3 states. [2020-10-25 19:39:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,167 INFO L93 Difference]: Finished difference Result 4489 states and 7269 transitions. [2020-10-25 19:39:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,192 INFO L225 Difference]: With dead ends: 4489 [2020-10-25 19:39:06,192 INFO L226 Difference]: Without dead ends: 4487 [2020-10-25 19:39:06,195 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-25 19:39:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2020-10-25 19:39:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2020-10-25 19:39:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2020-10-25 19:39:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2020-10-25 19:39:06,335 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2020-10-25 19:39:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,336 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2020-10-25 19:39:06,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2020-10-25 19:39:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:06,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,343 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] [2020-10-25 19:39:06,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:39:06,343 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2020-10-25 19:39:06,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411018498] [2020-10-25 19:39:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:06,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411018498] [2020-10-25 19:39:06,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168609654] [2020-10-25 19:39:06,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,370 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand 3 states. [2020-10-25 19:39:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,509 INFO L93 Difference]: Finished difference Result 8393 states and 13029 transitions. [2020-10-25 19:39:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,535 INFO L225 Difference]: With dead ends: 8393 [2020-10-25 19:39:06,536 INFO L226 Difference]: Without dead ends: 4871 [2020-10-25 19:39:06,540 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-25 19:39:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2020-10-25 19:39:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2020-10-25 19:39:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4869 states. [2020-10-25 19:39:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2020-10-25 19:39:06,722 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2020-10-25 19:39:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,722 INFO L481 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2020-10-25 19:39:06,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2020-10-25 19:39:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:06,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,729 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] [2020-10-25 19:39:06,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:39:06,730 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2020-10-25 19:39:06,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425797861] [2020-10-25 19:39:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,768 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-25 19:39:06,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425797861] [2020-10-25 19:39:06,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387772558] [2020-10-25 19:39:06,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,770 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand 3 states. [2020-10-25 19:39:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,907 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2020-10-25 19:39:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,940 INFO L225 Difference]: With dead ends: 7305 [2020-10-25 19:39:06,940 INFO L226 Difference]: Without dead ends: 4935 [2020-10-25 19:39:06,944 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-25 19:39:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2020-10-25 19:39:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2020-10-25 19:39:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4933 states. [2020-10-25 19:39:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2020-10-25 19:39:07,111 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2020-10-25 19:39:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:07,112 INFO L481 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2020-10-25 19:39:07,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2020-10-25 19:39:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:07,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:07,120 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] [2020-10-25 19:39:07,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:39:07,123 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2020-10-25 19:39:07,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:07,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752002381] [2020-10-25 19:39:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,194 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-25 19:39:07,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752002381] [2020-10-25 19:39:07,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:07,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:07,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317616251] [2020-10-25 19:39:07,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:07,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,200 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand 3 states. [2020-10-25 19:39:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:07,374 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2020-10-25 19:39:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:07,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:07,396 INFO L225 Difference]: With dead ends: 8713 [2020-10-25 19:39:07,397 INFO L226 Difference]: Without dead ends: 8711 [2020-10-25 19:39:07,400 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-25 19:39:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2020-10-25 19:39:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2020-10-25 19:39:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7173 states. [2020-10-25 19:39:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2020-10-25 19:39:07,669 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2020-10-25 19:39:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:07,670 INFO L481 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2020-10-25 19:39:07,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2020-10-25 19:39:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:07,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:07,680 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] [2020-10-25 19:39:07,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 19:39:07,681 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2020-10-25 19:39:07,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:07,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844350978] [2020-10-25 19:39:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,702 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-25 19:39:07,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844350978] [2020-10-25 19:39:07,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:07,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:07,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466070298] [2020-10-25 19:39:07,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:07,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:07,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:07,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,704 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand 3 states. [2020-10-25 19:39:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:07,834 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2020-10-25 19:39:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:07,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:07,859 INFO L225 Difference]: With dead ends: 16649 [2020-10-25 19:39:07,859 INFO L226 Difference]: Without dead ends: 9607 [2020-10-25 19:39:07,873 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-25 19:39:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2020-10-25 19:39:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2020-10-25 19:39:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9605 states. [2020-10-25 19:39:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2020-10-25 19:39:08,296 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2020-10-25 19:39:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:08,297 INFO L481 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2020-10-25 19:39:08,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2020-10-25 19:39:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:08,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:08,321 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] [2020-10-25 19:39:08,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:39:08,321 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2020-10-25 19:39:08,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:08,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698675470] [2020-10-25 19:39:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:08,345 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-25 19:39:08,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698675470] [2020-10-25 19:39:08,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:08,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:08,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710517628] [2020-10-25 19:39:08,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:08,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:08,348 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand 3 states. [2020-10-25 19:39:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:08,497 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2020-10-25 19:39:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:08,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:08,523 INFO L225 Difference]: With dead ends: 14409 [2020-10-25 19:39:08,523 INFO L226 Difference]: Without dead ends: 9735 [2020-10-25 19:39:08,534 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-25 19:39:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2020-10-25 19:39:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2020-10-25 19:39:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9733 states. [2020-10-25 19:39:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2020-10-25 19:39:08,860 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2020-10-25 19:39:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:08,860 INFO L481 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2020-10-25 19:39:08,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2020-10-25 19:39:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:08,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:08,873 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] [2020-10-25 19:39:08,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 19:39:08,873 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2020-10-25 19:39:08,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:08,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774887023] [2020-10-25 19:39:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:08,895 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-25 19:39:08,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774887023] [2020-10-25 19:39:08,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:08,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:08,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061150288] [2020-10-25 19:39:08,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:08,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:08,898 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand 3 states. [2020-10-25 19:39:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:09,085 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2020-10-25 19:39:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:09,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:09,131 INFO L225 Difference]: With dead ends: 16905 [2020-10-25 19:39:09,132 INFO L226 Difference]: Without dead ends: 16903 [2020-10-25 19:39:09,141 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-25 19:39:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2020-10-25 19:39:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2020-10-25 19:39:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14341 states. [2020-10-25 19:39:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2020-10-25 19:39:09,635 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2020-10-25 19:39:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:09,636 INFO L481 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2020-10-25 19:39:09,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2020-10-25 19:39:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:09,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:09,658 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] [2020-10-25 19:39:09,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:39:09,658 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2020-10-25 19:39:09,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:09,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406524462] [2020-10-25 19:39:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:09,679 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-25 19:39:09,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406524462] [2020-10-25 19:39:09,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:09,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:09,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038485115] [2020-10-25 19:39:09,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:09,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:09,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:09,681 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand 3 states. [2020-10-25 19:39:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:09,916 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2020-10-25 19:39:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:09,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:09,961 INFO L225 Difference]: With dead ends: 33033 [2020-10-25 19:39:09,962 INFO L226 Difference]: Without dead ends: 18951 [2020-10-25 19:39:09,985 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-25 19:39:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2020-10-25 19:39:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2020-10-25 19:39:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18949 states. [2020-10-25 19:39:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2020-10-25 19:39:10,702 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2020-10-25 19:39:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:10,703 INFO L481 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2020-10-25 19:39:10,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2020-10-25 19:39:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:10,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:10,726 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] [2020-10-25 19:39:10,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:39:10,727 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2020-10-25 19:39:10,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:10,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522562682] [2020-10-25 19:39:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:10,759 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-25 19:39:10,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522562682] [2020-10-25 19:39:10,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:10,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:10,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546308943] [2020-10-25 19:39:10,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:10,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:10,763 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand 3 states. [2020-10-25 19:39:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:11,127 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2020-10-25 19:39:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:11,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:11,173 INFO L225 Difference]: With dead ends: 28425 [2020-10-25 19:39:11,173 INFO L226 Difference]: Without dead ends: 19207 [2020-10-25 19:39:11,185 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-25 19:39:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2020-10-25 19:39:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2020-10-25 19:39:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19205 states. [2020-10-25 19:39:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2020-10-25 19:39:11,801 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2020-10-25 19:39:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:11,802 INFO L481 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2020-10-25 19:39:11,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2020-10-25 19:39:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:11,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:11,820 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] [2020-10-25 19:39:11,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:39:11,821 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2020-10-25 19:39:11,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:11,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803283440] [2020-10-25 19:39:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:11,849 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-25 19:39:11,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803283440] [2020-10-25 19:39:11,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:11,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:11,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469990231] [2020-10-25 19:39:11,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:11,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:11,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:11,852 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand 3 states. [2020-10-25 19:39:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:12,327 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2020-10-25 19:39:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:12,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:12,459 INFO L225 Difference]: With dead ends: 32777 [2020-10-25 19:39:12,460 INFO L226 Difference]: Without dead ends: 32775 [2020-10-25 19:39:12,466 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-25 19:39:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2020-10-25 19:39:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2020-10-25 19:39:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28677 states. [2020-10-25 19:39:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2020-10-25 19:39:13,218 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2020-10-25 19:39:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:13,218 INFO L481 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2020-10-25 19:39:13,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2020-10-25 19:39:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:13,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:13,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] [2020-10-25 19:39:13,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:39:13,256 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2020-10-25 19:39:13,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:13,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500395461] [2020-10-25 19:39:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:13,280 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-25 19:39:13,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500395461] [2020-10-25 19:39:13,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:13,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:13,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673574076] [2020-10-25 19:39:13,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:13,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:13,284 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand 3 states. [2020-10-25 19:39:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:13,957 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2020-10-25 19:39:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:13,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:14,034 INFO L225 Difference]: With dead ends: 65545 [2020-10-25 19:39:14,034 INFO L226 Difference]: Without dead ends: 37383 [2020-10-25 19:39:14,063 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-25 19:39:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2020-10-25 19:39:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2020-10-25 19:39:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37381 states. [2020-10-25 19:39:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2020-10-25 19:39:15,076 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2020-10-25 19:39:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:15,076 INFO L481 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2020-10-25 19:39:15,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2020-10-25 19:39:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:39:15,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:15,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:15,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:39:15,101 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2020-10-25 19:39:15,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:15,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916473058] [2020-10-25 19:39:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:15,120 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-25 19:39:15,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916473058] [2020-10-25 19:39:15,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:15,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:15,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934337083] [2020-10-25 19:39:15,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:15,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:15,122 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand 3 states. [2020-10-25 19:39:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:15,711 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2020-10-25 19:39:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:15,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:39:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:15,772 INFO L225 Difference]: With dead ends: 56073 [2020-10-25 19:39:15,773 INFO L226 Difference]: Without dead ends: 37895 [2020-10-25 19:39:15,798 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-25 19:39:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2020-10-25 19:39:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2020-10-25 19:39:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37893 states. [2020-10-25 19:39:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2020-10-25 19:39:16,711 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2020-10-25 19:39:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:16,712 INFO L481 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2020-10-25 19:39:16,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2020-10-25 19:39:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:39:16,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:16,733 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] [2020-10-25 19:39:16,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:39:16,734 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2020-10-25 19:39:16,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:16,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225130023] [2020-10-25 19:39:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:16,756 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-25 19:39:16,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225130023] [2020-10-25 19:39:16,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:16,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:16,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810584411] [2020-10-25 19:39:16,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:16,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:16,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:16,758 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand 3 states. [2020-10-25 19:39:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:17,536 INFO L93 Difference]: Finished difference Result 110601 states and 141317 transitions. [2020-10-25 19:39:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:17,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:39:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:17,642 INFO L225 Difference]: With dead ends: 110601 [2020-10-25 19:39:17,643 INFO L226 Difference]: Without dead ends: 73735 [2020-10-25 19:39:17,679 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-25 19:39:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2020-10-25 19:39:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2020-10-25 19:39:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73733 states. [2020-10-25 19:39:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2020-10-25 19:39:19,212 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2020-10-25 19:39:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:19,213 INFO L481 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2020-10-25 19:39:19,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2020-10-25 19:39:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:39:19,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:19,296 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] [2020-10-25 19:39:19,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:39:19,296 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2020-10-25 19:39:19,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:19,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356799523] [2020-10-25 19:39:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:19,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356799523] [2020-10-25 19:39:19,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:19,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:19,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297644615] [2020-10-25 19:39:19,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:19,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:19,328 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand 3 states. [2020-10-25 19:39:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:20,282 INFO L93 Difference]: Finished difference Result 79881 states and 102405 transitions. [2020-10-25 19:39:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:20,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:39:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:20,355 INFO L225 Difference]: With dead ends: 79881 [2020-10-25 19:39:20,356 INFO L226 Difference]: Without dead ends: 79879 [2020-10-25 19:39:20,370 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-25 19:39:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2020-10-25 19:39:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2020-10-25 19:39:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73733 states. [2020-10-25 19:39:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2020-10-25 19:39:21,872 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2020-10-25 19:39:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:21,872 INFO L481 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2020-10-25 19:39:21,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2020-10-25 19:39:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 19:39:21,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:21,904 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] [2020-10-25 19:39:21,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:39:21,905 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2020-10-25 19:39:21,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:21,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165046837] [2020-10-25 19:39:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:21,964 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-25 19:39:21,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165046837] [2020-10-25 19:39:21,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:21,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:21,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626721349] [2020-10-25 19:39:21,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:21,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:21,968 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand 3 states. [2020-10-25 19:39:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:23,114 INFO L93 Difference]: Finished difference Result 121865 states and 151557 transitions. [2020-10-25 19:39:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:23,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-10-25 19:39:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:23,255 INFO L225 Difference]: With dead ends: 121865 [2020-10-25 19:39:23,255 INFO L226 Difference]: Without dead ends: 121863 [2020-10-25 19:39:23,275 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-25 19:39:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2020-10-25 19:39:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2020-10-25 19:39:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113669 states. [2020-10-25 19:39:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2020-10-25 19:39:25,253 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2020-10-25 19:39:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:25,254 INFO L481 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2020-10-25 19:39:25,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2020-10-25 19:39:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 19:39:25,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:25,316 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] [2020-10-25 19:39:25,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 19:39:25,316 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2020-10-25 19:39:25,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:25,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176886433] [2020-10-25 19:39:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:25,344 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-25 19:39:25,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176886433] [2020-10-25 19:39:25,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:25,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:25,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814899811] [2020-10-25 19:39:25,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:25,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:25,346 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand 3 states. [2020-10-25 19:39:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:27,286 INFO L93 Difference]: Finished difference Result 257033 states and 309253 transitions. [2020-10-25 19:39:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:27,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-10-25 19:39:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:27,508 INFO L225 Difference]: With dead ends: 257033 [2020-10-25 19:39:27,509 INFO L226 Difference]: Without dead ends: 144391 [2020-10-25 19:39:27,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144391 states. [2020-10-25 19:39:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144391 to 144389. [2020-10-25 19:39:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144389 states. [2020-10-25 19:39:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144389 states to 144389 states and 169987 transitions. [2020-10-25 19:39:30,541 INFO L78 Accepts]: Start accepts. Automaton has 144389 states and 169987 transitions. Word has length 31 [2020-10-25 19:39:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:30,541 INFO L481 AbstractCegarLoop]: Abstraction has 144389 states and 169987 transitions. [2020-10-25 19:39:30,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 144389 states and 169987 transitions. [2020-10-25 19:39:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 19:39:30,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:30,625 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] [2020-10-25 19:39:30,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:39:30,625 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1363278403, now seen corresponding path program 1 times [2020-10-25 19:39:30,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:30,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270722202] [2020-10-25 19:39:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:30,681 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-25 19:39:30,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270722202] [2020-10-25 19:39:30,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:30,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:30,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653493331] [2020-10-25 19:39:30,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:30,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:30,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:30,688 INFO L87 Difference]: Start difference. First operand 144389 states and 169987 transitions. Second operand 3 states. [2020-10-25 19:39:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:32,281 INFO L93 Difference]: Finished difference Result 218121 states and 257029 transitions. [2020-10-25 19:39:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:32,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-10-25 19:39:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:32,826 INFO L225 Difference]: With dead ends: 218121 [2020-10-25 19:39:32,826 INFO L226 Difference]: Without dead ends: 147463 [2020-10-25 19:39:32,873 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-25 19:39:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2020-10-25 19:39:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 147461. [2020-10-25 19:39:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147461 states. [2020-10-25 19:39:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 172035 transitions. [2020-10-25 19:39:35,979 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 172035 transitions. Word has length 32 [2020-10-25 19:39:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:35,979 INFO L481 AbstractCegarLoop]: Abstraction has 147461 states and 172035 transitions. [2020-10-25 19:39:35,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 172035 transitions. [2020-10-25 19:39:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 19:39:36,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:36,059 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] [2020-10-25 19:39:36,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 19:39:36,059 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1343340991, now seen corresponding path program 1 times [2020-10-25 19:39:36,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:36,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504273762] [2020-10-25 19:39:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:36,138 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-25 19:39:36,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504273762] [2020-10-25 19:39:36,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:36,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:36,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771997709] [2020-10-25 19:39:36,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:36,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:36,142 INFO L87 Difference]: Start difference. First operand 147461 states and 172035 transitions. Second operand 3 states. [2020-10-25 19:39:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:39,159 INFO L93 Difference]: Finished difference Result 237575 states and 274436 transitions. [2020-10-25 19:39:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:39,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-10-25 19:39:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:39,548 INFO L225 Difference]: With dead ends: 237575 [2020-10-25 19:39:39,548 INFO L226 Difference]: Without dead ends: 237573 [2020-10-25 19:39:39,600 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-25 19:39:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237573 states. [2020-10-25 19:39:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237573 to 229381. [2020-10-25 19:39:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229381 states. [2020-10-25 19:39:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229381 states to 229381 states and 262147 transitions. [2020-10-25 19:39:43,681 INFO L78 Accepts]: Start accepts. Automaton has 229381 states and 262147 transitions. Word has length 32 [2020-10-25 19:39:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:43,682 INFO L481 AbstractCegarLoop]: Abstraction has 229381 states and 262147 transitions. [2020-10-25 19:39:43,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 229381 states and 262147 transitions. [2020-10-25 19:39:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 19:39:43,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:43,835 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] [2020-10-25 19:39:43,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-25 19:39:43,835 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash 322272637, now seen corresponding path program 1 times [2020-10-25 19:39:43,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:43,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090790746] [2020-10-25 19:39:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:43,873 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-25 19:39:43,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090790746] [2020-10-25 19:39:43,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:43,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:43,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314404448] [2020-10-25 19:39:43,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:43,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:43,876 INFO L87 Difference]: Start difference. First operand 229381 states and 262147 transitions. Second operand 3 states. [2020-10-25 19:39:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:47,485 INFO L93 Difference]: Finished difference Result 512005 states and 577539 transitions. [2020-10-25 19:39:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:47,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-10-25 19:39:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:47,486 INFO L225 Difference]: With dead ends: 512005 [2020-10-25 19:39:47,486 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:39:47,657 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-25 19:39:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:39:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:39:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:39:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:39:47,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-10-25 19:39:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:47,658 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:39:47,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:39:47,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:39:47,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-25 19:39:47,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L52(lines 52 54) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L152-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L119-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L103-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,728 INFO L274 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L87-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L277 CegarLoopResult]: At program point L203(lines 7 207) the Hoare annotation is: true [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L137-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L187-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L172-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L123-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L277 CegarLoopResult]: At program point L206(lines 6 207) the Hoare annotation is: true [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-10-25 19:39:47,729 INFO L274 CegarLoopResult]: For program point L107-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,730 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:39:47,730 INFO L274 CegarLoopResult]: For program point L157-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,730 INFO L274 CegarLoopResult]: For program point L91-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,730 INFO L274 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-10-25 19:39:47,730 INFO L274 CegarLoopResult]: For program point L142-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L192-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L127-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L177-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L111-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L95-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2020-10-25 19:39:47,731 INFO L274 CegarLoopResult]: For program point L162-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,732 INFO L274 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-10-25 19:39:47,732 INFO L274 CegarLoopResult]: For program point L147-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,732 INFO L277 CegarLoopResult]: At program point L197-1(lines 50 202) the Hoare annotation is: true [2020-10-25 19:39:47,732 INFO L274 CegarLoopResult]: For program point L131-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,732 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point L115-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L270 CegarLoopResult]: At program point L198-1(lines 7 207) the Hoare annotation is: false [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point L99-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,733 INFO L274 CegarLoopResult]: For program point L182-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,734 INFO L274 CegarLoopResult]: For program point L83(lines 83 85) no Hoare annotation was computed. [2020-10-25 19:39:47,734 INFO L274 CegarLoopResult]: For program point L83-2(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,734 INFO L274 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2020-10-25 19:39:47,734 INFO L274 CegarLoopResult]: For program point L167-1(lines 50 202) no Hoare annotation was computed. [2020-10-25 19:39:47,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:39:47 BoogieIcfgContainer [2020-10-25 19:39:47,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:39:47,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:39:47,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:39:47,748 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:39:47,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:03" (3/4) ... [2020-10-25 19:39:47,752 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:39:47,769 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 19:39:47,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:39:47,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:47,771 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:47,850 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:39:47,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:39:47,853 INFO L168 Benchmark]: Toolchain (without parser) took 45655.37 ms. Allocated memory was 46.1 MB in the beginning and 15.3 GB in the end (delta: 15.3 GB). Free memory was 23.0 MB in the beginning and 11.7 GB in the end (delta: -11.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,854 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 46.1 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 33.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:39:47,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.56 ms. Allocated memory is still 46.1 MB. Free memory was 22.4 MB in the beginning and 23.0 MB in the end (delta: -618.4 kB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.50 ms. Allocated memory is still 46.1 MB. Free memory was 22.9 MB in the beginning and 21.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:39:47,855 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 40.1 MB in the end (delta: -18.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,855 INFO L168 Benchmark]: RCFGBuilder took 533.68 ms. Allocated memory is still 56.6 MB. Free memory was 40.1 MB in the beginning and 31.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,856 INFO L168 Benchmark]: TraceAbstraction took 44535.43 ms. Allocated memory was 56.6 MB in the beginning and 15.3 GB in the end (delta: 15.3 GB). Free memory was 31.2 MB in the beginning and 11.7 GB in the end (delta: -11.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,856 INFO L168 Benchmark]: Witness Printer took 103.33 ms. Allocated memory is still 15.3 GB. Free memory was 11.7 GB in the beginning and 11.7 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:47,859 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.33 ms. Allocated memory is still 46.1 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 33.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 379.56 ms. Allocated memory is still 46.1 MB. Free memory was 22.4 MB in the beginning and 23.0 MB in the end (delta: -618.4 kB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.50 ms. Allocated memory is still 46.1 MB. Free memory was 22.9 MB in the beginning and 21.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 40.1 MB in the end (delta: -18.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 533.68 ms. Allocated memory is still 56.6 MB. Free memory was 40.1 MB in the beginning and 31.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 44535.43 ms. Allocated memory was 56.6 MB in the beginning and 15.3 GB in the end (delta: 15.3 GB). Free memory was 31.2 MB in the beginning and 11.7 GB in the end (delta: -11.7 GB). Peak memory consumption was 3.6 GB. Max. memory is 16.1 GB. * Witness Printer took 103.33 ms. Allocated memory is still 15.3 GB. Free memory was 11.7 GB in the beginning and 11.7 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3801 SDtfs, 1926 SDslu, 2568 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229381occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 50632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...