./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_10.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7b0b589689413087c164ce10eb80c902ee4046 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:20,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:20,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:20,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:20,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:20,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:20,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:20,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:20,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:20,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:20,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:20,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:20,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:20,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:20,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:20,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:20,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:20,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:20,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:20,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:20,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:20,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:20,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:20,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:20,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:20,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:20,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:20,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:20,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:20,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:20,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:20,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:20,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:20,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:20,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:20,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:20,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:20,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:20,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:20,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:20,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:20,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:20,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:20,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:20,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:20,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:20,522 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:20,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:20,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:20,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:20,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:20,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:20,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:20,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:20,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:20,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:20,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:20,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:20,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:20,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:20,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:20,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:20,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:20,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:20,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:20,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:20,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:20,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:20,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:20,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:20,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:20,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-11-28 15:40:20,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:20,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:20,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:20,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:20,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:20,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 15:40:21,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e51d9a1/1396618bc01645f5ac02f7cf88fc7bd8/FLAG91484cb63 [2019-11-28 15:40:21,495 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:21,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2019-11-28 15:40:21,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e51d9a1/1396618bc01645f5ac02f7cf88fc7bd8/FLAG91484cb63 [2019-11-28 15:40:21,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e51d9a1/1396618bc01645f5ac02f7cf88fc7bd8 [2019-11-28 15:40:21,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:21,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:21,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:21,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:21,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:21,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:21" (1/1) ... [2019-11-28 15:40:21,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78418a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:21, skipping insertion in model container [2019-11-28 15:40:21,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:21" (1/1) ... [2019-11-28 15:40:21,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:21,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:22,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:22,199 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:22,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:22,337 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:22,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22 WrapperNode [2019-11-28 15:40:22,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:22,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:22,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:22,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:22,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:22,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:22,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:22,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:22,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (1/1) ... [2019-11-28 15:40:22,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:22,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:22,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:22,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:22,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (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 [2019-11-28 15:40:22,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:22,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:22,829 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:22,829 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:22,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:22 BoogieIcfgContainer [2019-11-28 15:40:22,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:22,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:22,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:22,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:22,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:21" (1/3) ... [2019-11-28 15:40:22,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c42c965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:22, skipping insertion in model container [2019-11-28 15:40:22,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:22" (2/3) ... [2019-11-28 15:40:22,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c42c965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:22, skipping insertion in model container [2019-11-28 15:40:22,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:22" (3/3) ... [2019-11-28 15:40:22,839 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-11-28 15:40:22,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:22,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:22,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:22,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:22,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:22,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:22,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:22,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:22,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:22,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:22,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-11-28 15:40:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:22,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:22,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:22,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-11-28 15:40:22,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:22,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3552700] [2019-11-28 15:40:22,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3552700] [2019-11-28 15:40:23,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646135689] [2019-11-28 15:40:23,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,156 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-11-28 15:40:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,217 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-11-28 15:40:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,230 INFO L225 Difference]: With dead ends: 82 [2019-11-28 15:40:23,230 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 15:40:23,234 INFO L630 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 [2019-11-28 15:40:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 15:40:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-11-28 15:40:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 15:40:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-11-28 15:40:23,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-11-28 15:40:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,280 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-11-28 15:40:23,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-11-28 15:40:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:23,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,282 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-11-28 15:40:23,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704716078] [2019-11-28 15:40:23,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704716078] [2019-11-28 15:40:23,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58351386] [2019-11-28 15:40:23,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,367 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-11-28 15:40:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,400 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-11-28 15:40:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,403 INFO L225 Difference]: With dead ends: 113 [2019-11-28 15:40:23,403 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 15:40:23,404 INFO L630 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 [2019-11-28 15:40:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 15:40:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 15:40:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 15:40:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-28 15:40:23,416 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-11-28 15:40:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-28 15:40:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-28 15:40:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:23,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,418 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-11-28 15:40:23,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831919115] [2019-11-28 15:40:23,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831919115] [2019-11-28 15:40:23,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057139775] [2019-11-28 15:40:23,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,496 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-28 15:40:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,540 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-11-28 15:40:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,544 INFO L225 Difference]: With dead ends: 104 [2019-11-28 15:40:23,544 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 15:40:23,547 INFO L630 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 [2019-11-28 15:40:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 15:40:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-28 15:40:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 15:40:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-11-28 15:40:23,557 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-11-28 15:40:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,557 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-11-28 15:40:23,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-11-28 15:40:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:23,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,559 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-11-28 15:40:23,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366483389] [2019-11-28 15:40:23,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366483389] [2019-11-28 15:40:23,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310585981] [2019-11-28 15:40:23,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,651 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-11-28 15:40:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,678 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-11-28 15:40:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,680 INFO L225 Difference]: With dead ends: 132 [2019-11-28 15:40:23,680 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 15:40:23,682 INFO L630 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 [2019-11-28 15:40:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 15:40:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-11-28 15:40:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 15:40:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-11-28 15:40:23,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-11-28 15:40:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,701 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-11-28 15:40:23,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-11-28 15:40:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:23,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,703 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-11-28 15:40:23,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552971322] [2019-11-28 15:40:23,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552971322] [2019-11-28 15:40:23,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066163611] [2019-11-28 15:40:23,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,771 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-11-28 15:40:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,792 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-11-28 15:40:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,798 INFO L225 Difference]: With dead ends: 220 [2019-11-28 15:40:23,798 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 15:40:23,799 INFO L630 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 [2019-11-28 15:40:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 15:40:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-11-28 15:40:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 15:40:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-11-28 15:40:23,809 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-11-28 15:40:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,810 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-11-28 15:40:23,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-11-28 15:40:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:23,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,811 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-11-28 15:40:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739191963] [2019-11-28 15:40:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739191963] [2019-11-28 15:40:23,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:23,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:23,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930816001] [2019-11-28 15:40:23,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:23,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:23,886 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-11-28 15:40:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:23,908 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-11-28 15:40:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:23,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:23,910 INFO L225 Difference]: With dead ends: 197 [2019-11-28 15:40:23,910 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 15:40:23,911 INFO L630 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 [2019-11-28 15:40:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 15:40:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-28 15:40:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 15:40:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-11-28 15:40:23,939 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-11-28 15:40:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:23,940 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-11-28 15:40:23,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-11-28 15:40:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:23,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:23,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:23,944 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-11-28 15:40:23,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:23,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814516230] [2019-11-28 15:40:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814516230] [2019-11-28 15:40:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540653967] [2019-11-28 15:40:24,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,010 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-11-28 15:40:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,050 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-11-28 15:40:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,053 INFO L225 Difference]: With dead ends: 380 [2019-11-28 15:40:24,053 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 15:40:24,054 INFO L630 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 [2019-11-28 15:40:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 15:40:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-28 15:40:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 15:40:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-11-28 15:40:24,069 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-11-28 15:40:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,069 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-11-28 15:40:24,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-11-28 15:40:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:24,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,072 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-11-28 15:40:24,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006682871] [2019-11-28 15:40:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006682871] [2019-11-28 15:40:24,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634042021] [2019-11-28 15:40:24,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,111 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-11-28 15:40:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,142 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-11-28 15:40:24,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,146 INFO L225 Difference]: With dead ends: 320 [2019-11-28 15:40:24,146 INFO L226 Difference]: Without dead ends: 318 [2019-11-28 15:40:24,147 INFO L630 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 [2019-11-28 15:40:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-28 15:40:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-11-28 15:40:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 15:40:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-11-28 15:40:24,161 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-11-28 15:40:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,161 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-11-28 15:40:24,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-11-28 15:40:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:24,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,164 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-11-28 15:40:24,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493240723] [2019-11-28 15:40:24,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493240723] [2019-11-28 15:40:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714649578] [2019-11-28 15:40:24,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,208 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-11-28 15:40:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,239 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-11-28 15:40:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,243 INFO L225 Difference]: With dead ends: 468 [2019-11-28 15:40:24,244 INFO L226 Difference]: Without dead ends: 466 [2019-11-28 15:40:24,245 INFO L630 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 [2019-11-28 15:40:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-28 15:40:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-11-28 15:40:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-28 15:40:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-11-28 15:40:24,273 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-11-28 15:40:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,274 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-11-28 15:40:24,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-11-28 15:40:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:24,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,277 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-11-28 15:40:24,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259992883] [2019-11-28 15:40:24,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259992883] [2019-11-28 15:40:24,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056884086] [2019-11-28 15:40:24,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,304 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-11-28 15:40:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,330 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-11-28 15:40:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,334 INFO L225 Difference]: With dead ends: 836 [2019-11-28 15:40:24,334 INFO L226 Difference]: Without dead ends: 490 [2019-11-28 15:40:24,336 INFO L630 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 [2019-11-28 15:40:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-28 15:40:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-11-28 15:40:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-28 15:40:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-11-28 15:40:24,356 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-11-28 15:40:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,357 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-11-28 15:40:24,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-11-28 15:40:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:24,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,359 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-11-28 15:40:24,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785346360] [2019-11-28 15:40:24,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785346360] [2019-11-28 15:40:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846379850] [2019-11-28 15:40:24,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,401 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-11-28 15:40:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,425 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-11-28 15:40:24,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,429 INFO L225 Difference]: With dead ends: 740 [2019-11-28 15:40:24,429 INFO L226 Difference]: Without dead ends: 502 [2019-11-28 15:40:24,431 INFO L630 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 [2019-11-28 15:40:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-28 15:40:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-11-28 15:40:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-28 15:40:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-11-28 15:40:24,450 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-11-28 15:40:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,451 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-11-28 15:40:24,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-11-28 15:40:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:24,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,453 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-11-28 15:40:24,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525917399] [2019-11-28 15:40:24,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525917399] [2019-11-28 15:40:24,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060028714] [2019-11-28 15:40:24,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,480 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-11-28 15:40:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,505 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-11-28 15:40:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,511 INFO L225 Difference]: With dead ends: 904 [2019-11-28 15:40:24,511 INFO L226 Difference]: Without dead ends: 902 [2019-11-28 15:40:24,512 INFO L630 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 [2019-11-28 15:40:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-11-28 15:40:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-11-28 15:40:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-28 15:40:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-11-28 15:40:24,540 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-11-28 15:40:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,540 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-11-28 15:40:24,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-11-28 15:40:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:24,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,543 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-11-28 15:40:24,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055395458] [2019-11-28 15:40:24,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055395458] [2019-11-28 15:40:24,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084338645] [2019-11-28 15:40:24,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,568 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-11-28 15:40:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,599 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-11-28 15:40:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,605 INFO L225 Difference]: With dead ends: 1656 [2019-11-28 15:40:24,606 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 15:40:24,608 INFO L630 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 [2019-11-28 15:40:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 15:40:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-11-28 15:40:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-28 15:40:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-11-28 15:40:24,645 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-11-28 15:40:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,646 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-11-28 15:40:24,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-11-28 15:40:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:24,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-11-28 15:40:24,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369366266] [2019-11-28 15:40:24,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369366266] [2019-11-28 15:40:24,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825738631] [2019-11-28 15:40:24,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,676 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-11-28 15:40:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,709 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-11-28 15:40:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,716 INFO L225 Difference]: With dead ends: 1448 [2019-11-28 15:40:24,716 INFO L226 Difference]: Without dead ends: 982 [2019-11-28 15:40:24,718 INFO L630 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 [2019-11-28 15:40:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-28 15:40:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-11-28 15:40:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-28 15:40:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-11-28 15:40:24,759 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-11-28 15:40:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,760 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-11-28 15:40:24,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-11-28 15:40:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:24,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,764 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-11-28 15:40:24,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249900834] [2019-11-28 15:40:24,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249900834] [2019-11-28 15:40:24,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704118107] [2019-11-28 15:40:24,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,795 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-11-28 15:40:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:24,839 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-11-28 15:40:24,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:24,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:24,852 INFO L225 Difference]: With dead ends: 1736 [2019-11-28 15:40:24,852 INFO L226 Difference]: Without dead ends: 1734 [2019-11-28 15:40:24,853 INFO L630 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 [2019-11-28 15:40:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-28 15:40:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-11-28 15:40:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-28 15:40:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-11-28 15:40:24,916 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-11-28 15:40:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:24,917 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-11-28 15:40:24,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-11-28 15:40:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:24,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:24,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:24,922 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-11-28 15:40:24,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:24,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799058379] [2019-11-28 15:40:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:24,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799058379] [2019-11-28 15:40:24,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:24,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:24,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965701405] [2019-11-28 15:40:24,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:24,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:24,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:24,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:24,952 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-11-28 15:40:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,016 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-11-28 15:40:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,030 INFO L225 Difference]: With dead ends: 3272 [2019-11-28 15:40:25,031 INFO L226 Difference]: Without dead ends: 1894 [2019-11-28 15:40:25,034 INFO L630 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 [2019-11-28 15:40:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-28 15:40:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-11-28 15:40:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-11-28 15:40:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-11-28 15:40:25,106 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-11-28 15:40:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,107 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-11-28 15:40:25,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-11-28 15:40:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:25,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,110 INFO L410 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] [2019-11-28 15:40:25,111 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-11-28 15:40:25,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911430042] [2019-11-28 15:40:25,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:25,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911430042] [2019-11-28 15:40:25,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799125776] [2019-11-28 15:40:25,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,139 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-11-28 15:40:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,183 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-11-28 15:40:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,194 INFO L225 Difference]: With dead ends: 2840 [2019-11-28 15:40:25,194 INFO L226 Difference]: Without dead ends: 1926 [2019-11-28 15:40:25,196 INFO L630 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 [2019-11-28 15:40:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-28 15:40:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-11-28 15:40:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-28 15:40:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-11-28 15:40:25,267 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-11-28 15:40:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,268 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-11-28 15:40:25,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-11-28 15:40:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:25,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,272 INFO L410 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] [2019-11-28 15:40:25,272 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-11-28 15:40:25,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686643724] [2019-11-28 15:40:25,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:25,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686643724] [2019-11-28 15:40:25,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029454142] [2019-11-28 15:40:25,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,299 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-11-28 15:40:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,379 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-11-28 15:40:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,403 INFO L225 Difference]: With dead ends: 3336 [2019-11-28 15:40:25,403 INFO L226 Difference]: Without dead ends: 3334 [2019-11-28 15:40:25,406 INFO L630 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 [2019-11-28 15:40:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-28 15:40:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-11-28 15:40:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-11-28 15:40:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-11-28 15:40:25,586 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-11-28 15:40:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,586 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-11-28 15:40:25,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-11-28 15:40:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:25,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,593 INFO L410 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] [2019-11-28 15:40:25,594 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-11-28 15:40:25,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42796089] [2019-11-28 15:40:25,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:25,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42796089] [2019-11-28 15:40:25,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4163796] [2019-11-28 15:40:25,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,623 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-11-28 15:40:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,711 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-11-28 15:40:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,733 INFO L225 Difference]: With dead ends: 6472 [2019-11-28 15:40:25,734 INFO L226 Difference]: Without dead ends: 3718 [2019-11-28 15:40:25,739 INFO L630 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 [2019-11-28 15:40:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-28 15:40:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-11-28 15:40:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-11-28 15:40:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-11-28 15:40:25,857 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-11-28 15:40:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,858 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-11-28 15:40:25,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-11-28 15:40:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:25,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,863 INFO L410 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] [2019-11-28 15:40:25,864 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-11-28 15:40:25,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724813002] [2019-11-28 15:40:25,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:25,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724813002] [2019-11-28 15:40:25,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857827806] [2019-11-28 15:40:25,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,886 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-11-28 15:40:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,962 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-11-28 15:40:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,981 INFO L225 Difference]: With dead ends: 5576 [2019-11-28 15:40:25,981 INFO L226 Difference]: Without dead ends: 3782 [2019-11-28 15:40:25,985 INFO L630 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 [2019-11-28 15:40:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-11-28 15:40:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-11-28 15:40:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-11-28 15:40:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-11-28 15:40:26,119 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-11-28 15:40:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,119 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-11-28 15:40:26,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-11-28 15:40:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:26,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,125 INFO L410 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] [2019-11-28 15:40:26,125 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-11-28 15:40:26,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075692020] [2019-11-28 15:40:26,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075692020] [2019-11-28 15:40:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777567784] [2019-11-28 15:40:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,149 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-11-28 15:40:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,251 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-11-28 15:40:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,281 INFO L225 Difference]: With dead ends: 6408 [2019-11-28 15:40:26,282 INFO L226 Difference]: Without dead ends: 6406 [2019-11-28 15:40:26,285 INFO L630 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 [2019-11-28 15:40:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-11-28 15:40:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-11-28 15:40:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-28 15:40:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-11-28 15:40:26,427 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-11-28 15:40:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,427 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-11-28 15:40:26,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-11-28 15:40:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:26,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,436 INFO L410 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] [2019-11-28 15:40:26,437 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-11-28 15:40:26,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800685863] [2019-11-28 15:40:26,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800685863] [2019-11-28 15:40:26,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005285143] [2019-11-28 15:40:26,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,457 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-11-28 15:40:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,569 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-11-28 15:40:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,584 INFO L225 Difference]: With dead ends: 12808 [2019-11-28 15:40:26,585 INFO L226 Difference]: Without dead ends: 7302 [2019-11-28 15:40:26,593 INFO L630 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 [2019-11-28 15:40:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-28 15:40:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-11-28 15:40:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-11-28 15:40:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-11-28 15:40:26,795 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-11-28 15:40:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,795 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-11-28 15:40:26,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-11-28 15:40:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:26,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,806 INFO L410 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] [2019-11-28 15:40:26,807 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-11-28 15:40:26,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237117254] [2019-11-28 15:40:26,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237117254] [2019-11-28 15:40:26,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664596347] [2019-11-28 15:40:26,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,839 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-11-28 15:40:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,984 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-11-28 15:40:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,004 INFO L225 Difference]: With dead ends: 10952 [2019-11-28 15:40:27,004 INFO L226 Difference]: Without dead ends: 7430 [2019-11-28 15:40:27,014 INFO L630 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 [2019-11-28 15:40:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-11-28 15:40:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-11-28 15:40:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-11-28 15:40:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-11-28 15:40:27,303 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-11-28 15:40:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,303 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-11-28 15:40:27,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-11-28 15:40:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:27,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,314 INFO L410 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] [2019-11-28 15:40:27,315 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-11-28 15:40:27,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510574639] [2019-11-28 15:40:27,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510574639] [2019-11-28 15:40:27,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222432125] [2019-11-28 15:40:27,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,339 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-11-28 15:40:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,515 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-11-28 15:40:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,539 INFO L225 Difference]: With dead ends: 12296 [2019-11-28 15:40:27,540 INFO L226 Difference]: Without dead ends: 12294 [2019-11-28 15:40:27,545 INFO L630 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 [2019-11-28 15:40:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-11-28 15:40:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-11-28 15:40:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-11-28 15:40:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-11-28 15:40:27,809 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-11-28 15:40:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,809 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-11-28 15:40:27,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-11-28 15:40:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:27,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,827 INFO L410 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] [2019-11-28 15:40:27,828 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-11-28 15:40:27,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456173213] [2019-11-28 15:40:27,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456173213] [2019-11-28 15:40:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238154185] [2019-11-28 15:40:27,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,846 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-11-28 15:40:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,088 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-11-28 15:40:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,116 INFO L225 Difference]: With dead ends: 25352 [2019-11-28 15:40:28,116 INFO L226 Difference]: Without dead ends: 14342 [2019-11-28 15:40:28,133 INFO L630 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 [2019-11-28 15:40:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-11-28 15:40:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-11-28 15:40:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-28 15:40:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-11-28 15:40:28,573 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-11-28 15:40:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,574 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-11-28 15:40:28,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-11-28 15:40:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:28,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,601 INFO L410 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] [2019-11-28 15:40:28,602 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-11-28 15:40:28,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322298746] [2019-11-28 15:40:28,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:28,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322298746] [2019-11-28 15:40:28,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273827950] [2019-11-28 15:40:28,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,653 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-11-28 15:40:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,023 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-11-28 15:40:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,060 INFO L225 Difference]: With dead ends: 21512 [2019-11-28 15:40:29,060 INFO L226 Difference]: Without dead ends: 14598 [2019-11-28 15:40:29,076 INFO L630 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 [2019-11-28 15:40:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-11-28 15:40:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-11-28 15:40:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-11-28 15:40:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-11-28 15:40:29,569 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-11-28 15:40:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,569 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-11-28 15:40:29,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-11-28 15:40:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:29,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,592 INFO L410 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] [2019-11-28 15:40:29,592 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-11-28 15:40:29,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834019038] [2019-11-28 15:40:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:29,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834019038] [2019-11-28 15:40:29,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882720140] [2019-11-28 15:40:29,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,615 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-11-28 15:40:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,927 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-11-28 15:40:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,970 INFO L225 Difference]: With dead ends: 23558 [2019-11-28 15:40:29,970 INFO L226 Difference]: Without dead ends: 23556 [2019-11-28 15:40:29,979 INFO L630 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 [2019-11-28 15:40:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-11-28 15:40:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-11-28 15:40:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-11-28 15:40:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-11-28 15:40:30,607 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-11-28 15:40:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,608 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-11-28 15:40:30,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-11-28 15:40:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:30,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,642 INFO L410 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] [2019-11-28 15:40:30,642 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-11-28 15:40:30,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224973646] [2019-11-28 15:40:30,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224973646] [2019-11-28 15:40:30,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193537071] [2019-11-28 15:40:30,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,669 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-11-28 15:40:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,074 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-11-28 15:40:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,076 INFO L225 Difference]: With dead ends: 50180 [2019-11-28 15:40:31,076 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:31,128 INFO L630 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 [2019-11-28 15:40:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:31,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-28 15:40:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:31,130 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:31,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:31,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:31,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:31,158 INFO L249 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:31,159 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L246 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L246 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L246 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L246 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,160 INFO L249 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-11-28 15:40:31,160 INFO L249 CegarLoopResult]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-11-28 15:40:31,161 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-28 15:40:31,163 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-28 15:40:31,163 INFO L242 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,164 INFO L246 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,165 INFO L246 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,165 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-11-28 15:40:31,165 INFO L246 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,165 INFO L246 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,165 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-28 15:40:31,166 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-28 15:40:31,167 INFO L246 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,167 INFO L246 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-11-28 15:40:31,167 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-28 15:40:31,167 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-28 15:40:31,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:31 BoogieIcfgContainer [2019-11-28 15:40:31,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:31,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:31,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:31,196 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:31,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:22" (3/4) ... [2019-11-28 15:40:31,201 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:31,219 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:31,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:31,328 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:31,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:31,331 INFO L168 Benchmark]: Toolchain (without parser) took 9432.27 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 274.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:31,332 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:31,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -100.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:31,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:31,333 INFO L168 Benchmark]: Boogie Preprocessor took 35.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:31,333 INFO L168 Benchmark]: RCFGBuilder took 415.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:31,334 INFO L168 Benchmark]: TraceAbstraction took 8363.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.3 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:31,334 INFO L168 Benchmark]: Witness Printer took 133.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:31,336 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -100.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 415.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8363.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.3 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. * Witness Printer took 133.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Result: SAFE, OverallTime: 8.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...