./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 30f4e4ab 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.24-30f4e4a [2019-11-27 22:35:53,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:53,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:53,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:53,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:53,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:53,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:53,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:53,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:53,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:53,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:53,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:53,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:53,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:53,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:53,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:53,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:53,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:53,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:53,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:53,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:53,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:53,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:53,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:53,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:53,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:53,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:53,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:53,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:53,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:53,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:53,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:53,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:53,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:53,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:53,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:53,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:53,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:53,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:53,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:53,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:53,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:53,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:53,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:53,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:53,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:53,483 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:53,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:53,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:53,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:53,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:53,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:53,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:53,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:53,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:53,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:53,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:53,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:53,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:53,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:53,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:53,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:53,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:53,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:53,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:53,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:53,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:53,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:53,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:53,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:53,490 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-27 22:35:53,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:53,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:53,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:53,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:53,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:53,863 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-27 22:35:53,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236ff79ce/c7aa3c1d1065432e9c7a90f636f567ba/FLAG8a31b501d [2019-11-27 22:35:54,415 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:54,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2019-11-27 22:35:54,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236ff79ce/c7aa3c1d1065432e9c7a90f636f567ba/FLAG8a31b501d [2019-11-27 22:35:54,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236ff79ce/c7aa3c1d1065432e9c7a90f636f567ba [2019-11-27 22:35:54,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:54,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:54,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:54,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:54,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:54,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:54" (1/1) ... [2019-11-27 22:35:54,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cf5917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:54, skipping insertion in model container [2019-11-27 22:35:54,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:54" (1/1) ... [2019-11-27 22:35:54,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:54,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:55,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:55,037 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:55,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:55,106 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:55,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55 WrapperNode [2019-11-27 22:35:55,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:55,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:55,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:55,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:55,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:55,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:55,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:55,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:55,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (1/1) ... [2019-11-27 22:35:55,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:55,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:55,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:55,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:55,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (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-27 22:35:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:55,636 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:55,636 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:35:55,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:55 BoogieIcfgContainer [2019-11-27 22:35:55,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:55,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:55,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:55,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:55,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:54" (1/3) ... [2019-11-27 22:35:55,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490961de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:55, skipping insertion in model container [2019-11-27 22:35:55,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:55" (2/3) ... [2019-11-27 22:35:55,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490961de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:55, skipping insertion in model container [2019-11-27 22:35:55,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:55" (3/3) ... [2019-11-27 22:35:55,645 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-11-27 22:35:55,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:55,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:55,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:55,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:55,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:55,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:55,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:55,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:55,721 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:55,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:55,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-11-27 22:35:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:35:55,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:55,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:55,747 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-11-27 22:35:55,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:55,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879846096] [2019-11-27 22:35:55,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:55,958 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-27 22:35:55,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879846096] [2019-11-27 22:35:55,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:55,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:55,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035321030] [2019-11-27 22:35:55,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:55,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:55,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:55,985 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-11-27 22:35:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,035 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-11-27 22:35:56,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:35:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,050 INFO L225 Difference]: With dead ends: 82 [2019-11-27 22:35:56,051 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 22:35:56,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-27 22:35:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 22:35:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-11-27 22:35:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-27 22:35:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-11-27 22:35:56,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-11-27 22:35:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,108 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-11-27 22:35:56,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-11-27 22:35:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:35:56,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-11-27 22:35:56,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290714815] [2019-11-27 22:35:56,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,191 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-27 22:35:56,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290714815] [2019-11-27 22:35:56,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190459374] [2019-11-27 22:35:56,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,195 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-11-27 22:35:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,236 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-11-27 22:35:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:35:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,238 INFO L225 Difference]: With dead ends: 113 [2019-11-27 22:35:56,238 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 22:35:56,239 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-27 22:35:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 22:35:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-27 22:35:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-27 22:35:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-11-27 22:35:56,250 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-11-27 22:35:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,251 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-11-27 22:35:56,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-11-27 22:35:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:35:56,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,253 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-11-27 22:35:56,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455039189] [2019-11-27 22:35:56,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,339 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-27 22:35:56,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455039189] [2019-11-27 22:35:56,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991274533] [2019-11-27 22:35:56,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,344 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-11-27 22:35:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,384 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-11-27 22:35:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:35:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,387 INFO L225 Difference]: With dead ends: 104 [2019-11-27 22:35:56,387 INFO L226 Difference]: Without dead ends: 71 [2019-11-27 22:35:56,391 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-27 22:35:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-27 22:35:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-27 22:35:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-27 22:35:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-11-27 22:35:56,407 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-11-27 22:35:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,407 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-11-27 22:35:56,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-11-27 22:35:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:35:56,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,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-27 22:35:56,417 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-11-27 22:35:56,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433868495] [2019-11-27 22:35:56,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,498 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-27 22:35:56,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433868495] [2019-11-27 22:35:56,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566772514] [2019-11-27 22:35:56,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,502 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-11-27 22:35:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,531 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-11-27 22:35:56,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:35:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,534 INFO L225 Difference]: With dead ends: 132 [2019-11-27 22:35:56,537 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:35:56,538 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-27 22:35:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:35:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-11-27 22:35:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-27 22:35:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-11-27 22:35:56,555 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-11-27 22:35:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,559 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-11-27 22:35:56,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-11-27 22:35:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:35:56,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:56,560 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-11-27 22:35:56,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982647445] [2019-11-27 22:35:56,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,631 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-27 22:35:56,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982647445] [2019-11-27 22:35:56,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31416575] [2019-11-27 22:35:56,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,633 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-11-27 22:35:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,670 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-11-27 22:35:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:35:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,675 INFO L225 Difference]: With dead ends: 220 [2019-11-27 22:35:56,677 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 22:35:56,678 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-27 22:35:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 22:35:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-11-27 22:35:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-27 22:35:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-11-27 22:35:56,700 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-11-27 22:35:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,700 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-11-27 22:35:56,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-11-27 22:35:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:35:56,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,706 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-27 22:35:56,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-11-27 22:35:56,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169287835] [2019-11-27 22:35:56,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,761 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-27 22:35:56,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169287835] [2019-11-27 22:35:56,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396316570] [2019-11-27 22:35:56,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,764 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-11-27 22:35:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,788 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-11-27 22:35:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:35:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,791 INFO L225 Difference]: With dead ends: 197 [2019-11-27 22:35:56,791 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 22:35:56,792 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-27 22:35:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 22:35:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-27 22:35:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-27 22:35:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-11-27 22:35:56,811 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-11-27 22:35:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,814 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-11-27 22:35:56,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-11-27 22:35:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:35:56,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,815 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-27 22:35:56,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-11-27 22:35:56,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776449384] [2019-11-27 22:35:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,862 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-27 22:35:56,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776449384] [2019-11-27 22:35:56,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686663050] [2019-11-27 22:35:56,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,865 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-11-27 22:35:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,886 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-11-27 22:35:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:35:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,889 INFO L225 Difference]: With dead ends: 380 [2019-11-27 22:35:56,889 INFO L226 Difference]: Without dead ends: 254 [2019-11-27 22:35:56,890 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-27 22:35:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-27 22:35:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-27 22:35:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-27 22:35:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-11-27 22:35:56,904 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-11-27 22:35:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,905 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-11-27 22:35:56,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-11-27 22:35:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:35:56,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,908 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-27 22:35:56,908 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-11-27 22:35:56,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748232064] [2019-11-27 22:35:56,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,932 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-27 22:35:56,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748232064] [2019-11-27 22:35:56,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058365271] [2019-11-27 22:35:56,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,935 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-11-27 22:35:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:56,953 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-11-27 22:35:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:56,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:35:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:56,956 INFO L225 Difference]: With dead ends: 320 [2019-11-27 22:35:56,957 INFO L226 Difference]: Without dead ends: 318 [2019-11-27 22:35:56,958 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-27 22:35:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-27 22:35:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-11-27 22:35:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-27 22:35:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-11-27 22:35:56,970 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-11-27 22:35:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-11-27 22:35:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-11-27 22:35:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:35:56,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:56,973 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-27 22:35:56,973 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-11-27 22:35:56,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:56,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671740659] [2019-11-27 22:35:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:56,997 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-27 22:35:56,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671740659] [2019-11-27 22:35:56,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:56,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:56,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70159299] [2019-11-27 22:35:56,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:56,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:56,999 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-11-27 22:35:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,023 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-11-27 22:35:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:35:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,027 INFO L225 Difference]: With dead ends: 468 [2019-11-27 22:35:57,027 INFO L226 Difference]: Without dead ends: 466 [2019-11-27 22:35:57,028 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-27 22:35:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-27 22:35:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-11-27 22:35:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-27 22:35:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-11-27 22:35:57,043 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-11-27 22:35:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,044 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-11-27 22:35:57,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-11-27 22:35:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:35:57,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,046 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-27 22:35:57,046 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-11-27 22:35:57,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272439806] [2019-11-27 22:35:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,068 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-27 22:35:57,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272439806] [2019-11-27 22:35:57,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646758418] [2019-11-27 22:35:57,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,071 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-11-27 22:35:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,098 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-11-27 22:35:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:35:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,102 INFO L225 Difference]: With dead ends: 836 [2019-11-27 22:35:57,102 INFO L226 Difference]: Without dead ends: 490 [2019-11-27 22:35:57,104 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-27 22:35:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-27 22:35:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-11-27 22:35:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-27 22:35:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-11-27 22:35:57,122 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-11-27 22:35:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,122 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-11-27 22:35:57,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-11-27 22:35:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:35:57,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,124 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-27 22:35:57,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-11-27 22:35:57,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312801705] [2019-11-27 22:35:57,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,155 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-27 22:35:57,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312801705] [2019-11-27 22:35:57,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554189095] [2019-11-27 22:35:57,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,159 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-11-27 22:35:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,186 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-11-27 22:35:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:35:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,190 INFO L225 Difference]: With dead ends: 740 [2019-11-27 22:35:57,190 INFO L226 Difference]: Without dead ends: 502 [2019-11-27 22:35:57,192 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-27 22:35:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-27 22:35:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-11-27 22:35:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-27 22:35:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-11-27 22:35:57,213 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-11-27 22:35:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,214 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-11-27 22:35:57,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-11-27 22:35:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:35:57,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,215 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-27 22:35:57,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-11-27 22:35:57,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030901629] [2019-11-27 22:35:57,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,254 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-27 22:35:57,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030901629] [2019-11-27 22:35:57,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858973845] [2019-11-27 22:35:57,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,256 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-11-27 22:35:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,287 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-11-27 22:35:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:35:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,295 INFO L225 Difference]: With dead ends: 904 [2019-11-27 22:35:57,295 INFO L226 Difference]: Without dead ends: 902 [2019-11-27 22:35:57,296 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-27 22:35:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-11-27 22:35:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-11-27 22:35:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-27 22:35:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-11-27 22:35:57,325 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-11-27 22:35:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,326 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-11-27 22:35:57,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-11-27 22:35:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:35:57,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,329 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-27 22:35:57,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-11-27 22:35:57,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346276399] [2019-11-27 22:35:57,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,366 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-27 22:35:57,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346276399] [2019-11-27 22:35:57,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296170219] [2019-11-27 22:35:57,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,369 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-11-27 22:35:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,408 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-11-27 22:35:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:35:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,415 INFO L225 Difference]: With dead ends: 1656 [2019-11-27 22:35:57,415 INFO L226 Difference]: Without dead ends: 966 [2019-11-27 22:35:57,417 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-27 22:35:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-27 22:35:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-11-27 22:35:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-27 22:35:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-11-27 22:35:57,452 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-11-27 22:35:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,453 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-11-27 22:35:57,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-11-27 22:35:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:35:57,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,457 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-27 22:35:57,457 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-11-27 22:35:57,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22849149] [2019-11-27 22:35:57,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,500 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-27 22:35:57,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22849149] [2019-11-27 22:35:57,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208517572] [2019-11-27 22:35:57,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,505 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-11-27 22:35:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,533 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-11-27 22:35:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:35:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,539 INFO L225 Difference]: With dead ends: 1448 [2019-11-27 22:35:57,540 INFO L226 Difference]: Without dead ends: 982 [2019-11-27 22:35:57,542 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-27 22:35:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-27 22:35:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-11-27 22:35:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-27 22:35:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-11-27 22:35:57,577 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-11-27 22:35:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,577 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-11-27 22:35:57,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-11-27 22:35:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:35:57,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,580 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-27 22:35:57,580 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-11-27 22:35:57,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973650429] [2019-11-27 22:35:57,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,608 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-27 22:35:57,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973650429] [2019-11-27 22:35:57,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092613722] [2019-11-27 22:35:57,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,613 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-11-27 22:35:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,652 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-11-27 22:35:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:35:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,662 INFO L225 Difference]: With dead ends: 1736 [2019-11-27 22:35:57,662 INFO L226 Difference]: Without dead ends: 1734 [2019-11-27 22:35:57,665 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-27 22:35:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-27 22:35:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-11-27 22:35:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-27 22:35:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-11-27 22:35:57,711 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-11-27 22:35:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,711 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-11-27 22:35:57,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-11-27 22:35:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:35:57,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,714 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-27 22:35:57,714 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-11-27 22:35:57,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358979319] [2019-11-27 22:35:57,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,734 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-27 22:35:57,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358979319] [2019-11-27 22:35:57,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294559198] [2019-11-27 22:35:57,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,738 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-11-27 22:35:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,779 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-11-27 22:35:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:35:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,788 INFO L225 Difference]: With dead ends: 3272 [2019-11-27 22:35:57,788 INFO L226 Difference]: Without dead ends: 1894 [2019-11-27 22:35:57,791 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-27 22:35:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-27 22:35:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-11-27 22:35:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-11-27 22:35:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-11-27 22:35:57,843 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-11-27 22:35:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,843 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-11-27 22:35:57,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-11-27 22:35:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:35:57,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,846 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-27 22:35:57,846 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-11-27 22:35:57,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022672522] [2019-11-27 22:35:57,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:57,869 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-27 22:35:57,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022672522] [2019-11-27 22:35:57,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:57,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:57,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200514188] [2019-11-27 22:35:57,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:57,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:57,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:57,871 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-11-27 22:35:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:57,910 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-11-27 22:35:57,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:57,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:35:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:57,919 INFO L225 Difference]: With dead ends: 2840 [2019-11-27 22:35:57,919 INFO L226 Difference]: Without dead ends: 1926 [2019-11-27 22:35:57,922 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-27 22:35:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-27 22:35:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-11-27 22:35:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-27 22:35:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-11-27 22:35:57,982 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-11-27 22:35:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:57,983 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-11-27 22:35:57,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-11-27 22:35:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:35:57,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:57,985 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-27 22:35:57,986 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-11-27 22:35:57,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:57,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497845661] [2019-11-27 22:35:57,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,005 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-27 22:35:58,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497845661] [2019-11-27 22:35:58,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070778942] [2019-11-27 22:35:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,007 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-11-27 22:35:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,059 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-11-27 22:35:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:35:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,073 INFO L225 Difference]: With dead ends: 3336 [2019-11-27 22:35:58,073 INFO L226 Difference]: Without dead ends: 3334 [2019-11-27 22:35:58,075 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-27 22:35:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-27 22:35:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-11-27 22:35:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-11-27 22:35:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-11-27 22:35:58,165 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-11-27 22:35:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,165 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-11-27 22:35:58,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-11-27 22:35:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:35:58,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,170 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-27 22:35:58,170 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-11-27 22:35:58,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-27 22:35:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,187 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-27 22:35:58,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-27 22:35:58,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063434213] [2019-11-27 22:35:58,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,189 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-11-27 22:35:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,260 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-11-27 22:35:58,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:35:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,280 INFO L225 Difference]: With dead ends: 6472 [2019-11-27 22:35:58,280 INFO L226 Difference]: Without dead ends: 3718 [2019-11-27 22:35:58,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-27 22:35:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-27 22:35:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-11-27 22:35:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-11-27 22:35:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-11-27 22:35:58,398 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-11-27 22:35:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,399 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-11-27 22:35:58,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-11-27 22:35:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:58,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,405 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-27 22:35:58,406 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-11-27 22:35:58,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-27 22:35:58,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,432 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-27 22:35:58,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-27 22:35:58,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149530584] [2019-11-27 22:35:58,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,434 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-11-27 22:35:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,497 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-11-27 22:35:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,515 INFO L225 Difference]: With dead ends: 5576 [2019-11-27 22:35:58,515 INFO L226 Difference]: Without dead ends: 3782 [2019-11-27 22:35:58,518 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-27 22:35:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-11-27 22:35:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-11-27 22:35:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-11-27 22:35:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-11-27 22:35:58,625 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-11-27 22:35:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,625 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-11-27 22:35:58,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-11-27 22:35:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:58,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,630 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-27 22:35:58,631 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-11-27 22:35:58,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082441587] [2019-11-27 22:35:58,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,656 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-27 22:35:58,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082441587] [2019-11-27 22:35:58,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978310125] [2019-11-27 22:35:58,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,658 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-11-27 22:35:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:58,737 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-11-27 22:35:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:58,775 INFO L225 Difference]: With dead ends: 6408 [2019-11-27 22:35:58,775 INFO L226 Difference]: Without dead ends: 6406 [2019-11-27 22:35:58,778 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-27 22:35:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-11-27 22:35:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-11-27 22:35:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-11-27 22:35:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-11-27 22:35:58,897 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-11-27 22:35:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:58,897 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-11-27 22:35:58,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-11-27 22:35:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:58,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:58,906 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-27 22:35:58,906 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-11-27 22:35:58,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94438503] [2019-11-27 22:35:58,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:58,922 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-27 22:35:58,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94438503] [2019-11-27 22:35:58,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:58,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:58,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806934209] [2019-11-27 22:35:58,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:58,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:58,924 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-11-27 22:35:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,024 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-11-27 22:35:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,038 INFO L225 Difference]: With dead ends: 12808 [2019-11-27 22:35:59,038 INFO L226 Difference]: Without dead ends: 7302 [2019-11-27 22:35:59,046 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-27 22:35:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-27 22:35:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-11-27 22:35:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-11-27 22:35:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-11-27 22:35:59,223 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-11-27 22:35:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,223 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-11-27 22:35:59,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-11-27 22:35:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:59,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,234 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-27 22:35:59,234 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-11-27 22:35:59,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819150007] [2019-11-27 22:35:59,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,251 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-27 22:35:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819150007] [2019-11-27 22:35:59,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:59,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271396382] [2019-11-27 22:35:59,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,253 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-11-27 22:35:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,367 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-11-27 22:35:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:35:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,383 INFO L225 Difference]: With dead ends: 10952 [2019-11-27 22:35:59,383 INFO L226 Difference]: Without dead ends: 7430 [2019-11-27 22:35:59,389 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-27 22:35:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-11-27 22:35:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-11-27 22:35:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-11-27 22:35:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-11-27 22:35:59,581 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-11-27 22:35:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,581 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-11-27 22:35:59,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-11-27 22:35:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:59,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,590 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-27 22:35:59,590 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-11-27 22:35:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311828329] [2019-11-27 22:35:59,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,604 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-27 22:35:59,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311828329] [2019-11-27 22:35:59,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:59,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147142529] [2019-11-27 22:35:59,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:59,606 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-11-27 22:35:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:59,734 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-11-27 22:35:59,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:59,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:35:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:59,754 INFO L225 Difference]: With dead ends: 12296 [2019-11-27 22:35:59,754 INFO L226 Difference]: Without dead ends: 12294 [2019-11-27 22:35:59,758 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-27 22:35:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-11-27 22:35:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-11-27 22:35:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-11-27 22:35:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-11-27 22:35:59,965 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-11-27 22:35:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:59,965 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-11-27 22:35:59,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-11-27 22:35:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:59,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:59,982 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-27 22:35:59,982 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-11-27 22:35:59,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:59,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700722762] [2019-11-27 22:35:59,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:59,998 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-27 22:35:59,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700722762] [2019-11-27 22:35:59,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:59,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:59,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717860093] [2019-11-27 22:35:59,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:59,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:00,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,000 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-11-27 22:36:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,166 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-11-27 22:36:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:00,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:36:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,192 INFO L225 Difference]: With dead ends: 25352 [2019-11-27 22:36:00,192 INFO L226 Difference]: Without dead ends: 14342 [2019-11-27 22:36:00,207 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-27 22:36:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-11-27 22:36:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-11-27 22:36:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-27 22:36:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-11-27 22:36:00,536 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-11-27 22:36:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:00,536 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-11-27 22:36:00,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-11-27 22:36:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:36:00,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:00,558 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-27 22:36:00,559 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-11-27 22:36:00,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:00,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-27 22:36:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:00,583 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-27 22:36:00,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-27 22:36:00,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:00,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:00,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246943746] [2019-11-27 22:36:00,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:00,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:00,654 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-11-27 22:36:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:00,831 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-11-27 22:36:00,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:00,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:36:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:00,857 INFO L225 Difference]: With dead ends: 21512 [2019-11-27 22:36:00,858 INFO L226 Difference]: Without dead ends: 14598 [2019-11-27 22:36:00,870 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-27 22:36:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-11-27 22:36:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-11-27 22:36:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-11-27 22:36:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-11-27 22:36:01,168 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-11-27 22:36:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:01,169 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-11-27 22:36:01,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-11-27 22:36:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:36:01,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:01,194 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-27 22:36:01,194 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-11-27 22:36:01,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:01,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200867392] [2019-11-27 22:36:01,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:01,213 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-27 22:36:01,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200867392] [2019-11-27 22:36:01,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:01,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:01,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358958955] [2019-11-27 22:36:01,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:01,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:01,216 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-11-27 22:36:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:01,482 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-11-27 22:36:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:01,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:36:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:01,525 INFO L225 Difference]: With dead ends: 23558 [2019-11-27 22:36:01,526 INFO L226 Difference]: Without dead ends: 23556 [2019-11-27 22:36:01,533 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-27 22:36:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-11-27 22:36:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-11-27 22:36:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-11-27 22:36:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-11-27 22:36:02,098 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-11-27 22:36:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:02,098 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-11-27 22:36:02,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-11-27 22:36:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:36:02,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:02,130 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-27 22:36:02,130 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-11-27 22:36:02,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:02,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766969542] [2019-11-27 22:36:02,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:02,148 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-27 22:36:02,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766969542] [2019-11-27 22:36:02,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:02,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:02,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469382567] [2019-11-27 22:36:02,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:02,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:02,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:02,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:02,150 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-11-27 22:36:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:02,494 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-11-27 22:36:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:02,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:36:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:02,495 INFO L225 Difference]: With dead ends: 50180 [2019-11-27 22:36:02,495 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:02,530 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-27 22:36:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:02,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-27 22:36:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:02,532 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:02,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:02,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:02,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:02,556 INFO L249 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,556 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:02,557 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-27 22:36:02,558 INFO L246 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,558 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-27 22:36:02,558 INFO L246 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,558 INFO L246 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,558 INFO L246 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,559 INFO L249 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-11-27 22:36:02,559 INFO L249 CegarLoopResult]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-11-27 22:36:02,559 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-27 22:36:02,559 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-27 22:36:02,559 INFO L242 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-11-27 22:36:02,559 INFO L246 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,559 INFO L246 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,559 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,560 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-27 22:36:02,561 INFO L246 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,562 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-27 22:36:02,562 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:02,562 INFO L246 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,562 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-27 22:36:02,562 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-27 22:36:02,563 INFO L246 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,563 INFO L246 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-11-27 22:36:02,563 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-27 22:36:02,563 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-27 22:36:02,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:02 BoogieIcfgContainer [2019-11-27 22:36:02,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:02,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:02,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:02,593 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:02,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:55" (3/4) ... [2019-11-27 22:36:02,597 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:02,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:02,615 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:02,726 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:02,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:02,729 INFO L168 Benchmark]: Toolchain (without parser) took 7930.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 487.6 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -210.3 MB). Peak memory consumption was 277.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,730 INFO L168 Benchmark]: CDTParser took 0.67 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-27 22:36:02,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.77 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,731 INFO L168 Benchmark]: Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,731 INFO L168 Benchmark]: RCFGBuilder took 407.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,732 INFO L168 Benchmark]: TraceAbstraction took 6953.26 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.4 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,732 INFO L168 Benchmark]: Witness Printer took 134.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:02,736 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.67 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 303.77 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 407.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6953.26 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.4 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. * Witness Printer took 134.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. 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: 6.8s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 2.6s, 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.1s 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: 2.6s 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...