./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 f2cbbf56a13532141372a32a461d64a9d1351c0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:36:11,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:36:11,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:36:11,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:36:11,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:36:11,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:36:11,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:36:11,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:36:11,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:36:11,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:36:11,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:36:11,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:36:11,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:36:11,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:36:11,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:36:11,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:36:11,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:36:11,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:36:11,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:36:11,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:36:11,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:36:11,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:36:11,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:36:11,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:36:11,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:36:11,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:36:11,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:36:11,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:36:11,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:36:11,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:36:11,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:36:11,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:36:11,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:36:11,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:36:11,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:36:11,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:36:11,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:36:11,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:36:11,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:36:11,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:36:11,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:36:11,834 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:36:11,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:36:11,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:36:11,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:36:11,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:36:11,854 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:36:11,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:36:11,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:36:11,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:36:11,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:36:11,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:36:11,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:36:11,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:36:11,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:36:11,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:36:11,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:36:11,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:36:11,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:36:11,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:36:11,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:36:11,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:36:11,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:36:11,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:11,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:36:11,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:36:11,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:36:11,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:36:11,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:36:11,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:36:11,861 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-11-27 22:36:12,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:36:12,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:36:12,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:36:12,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:36:12,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:36:12,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2019-11-27 22:36:12,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df23d2918/b99f92ebd3b74aaaacad8f598bd3fe3b/FLAGa4b973be1 [2019-11-27 22:36:12,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:36:12,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2019-11-27 22:36:12,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df23d2918/b99f92ebd3b74aaaacad8f598bd3fe3b/FLAGa4b973be1 [2019-11-27 22:36:13,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df23d2918/b99f92ebd3b74aaaacad8f598bd3fe3b [2019-11-27 22:36:13,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:36:13,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:36:13,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:13,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:36:13,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:36:13,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463e911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:36:13,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:36:13,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:13,367 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:36:13,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:13,484 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:36:13,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13 WrapperNode [2019-11-27 22:36:13,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:13,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:13,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:36:13,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:36:13,498 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:36:13" (1/1) ... [2019-11-27 22:36:13,505 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:36:13" (1/1) ... [2019-11-27 22:36:13,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:13,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:36:13,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:36:13,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:36:13,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:36:13,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:36:13,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (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:36:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:36:13,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:36:13,957 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:36:13,958 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:36:13,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13 BoogieIcfgContainer [2019-11-27 22:36:13,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:36:13,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:36:13,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:36:13,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:36:13,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:36:13" (1/3) ... [2019-11-27 22:36:13,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28220c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (2/3) ... [2019-11-27 22:36:13,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28220c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/3) ... [2019-11-27 22:36:13,967 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-11-27 22:36:13,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:36:13,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:36:13,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:36:14,027 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:36:14,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:36:14,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:36:14,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:36:14,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:36:14,030 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:36:14,033 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:36:14,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:36:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-27 22:36:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-11-27 22:36:14,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131917765] [2019-11-27 22:36:14,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,246 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:14,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131917765] [2019-11-27 22:36:14,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800075527] [2019-11-27 22:36:14,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-11-27 22:36:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,340 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-11-27 22:36:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,355 INFO L225 Difference]: With dead ends: 70 [2019-11-27 22:36:14,355 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 22:36:14,359 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:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 22:36:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-11-27 22:36:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-27 22:36:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-11-27 22:36:14,402 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-11-27 22:36:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,402 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-11-27 22:36:14,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-11-27 22:36:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,404 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-11-27 22:36:14,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242003031] [2019-11-27 22:36:14,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,494 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:14,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242003031] [2019-11-27 22:36:14,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792931584] [2019-11-27 22:36:14,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,498 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-11-27 22:36:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,555 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-11-27 22:36:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,557 INFO L225 Difference]: With dead ends: 93 [2019-11-27 22:36:14,558 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 22:36:14,561 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:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 22:36:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-27 22:36:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-27 22:36:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-11-27 22:36:14,580 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-11-27 22:36:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,580 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-11-27 22:36:14,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-11-27 22:36:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-11-27 22:36:14,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893706708] [2019-11-27 22:36:14,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,683 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:14,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893706708] [2019-11-27 22:36:14,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422149584] [2019-11-27 22:36:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,688 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-11-27 22:36:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,724 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-11-27 22:36:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,728 INFO L225 Difference]: With dead ends: 86 [2019-11-27 22:36:14,728 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 22:36:14,730 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:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 22:36:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-27 22:36:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-27 22:36:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-11-27 22:36:14,739 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-11-27 22:36:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,740 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-11-27 22:36:14,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-11-27 22:36:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,742 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-11-27 22:36:14,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986793756] [2019-11-27 22:36:14,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,784 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:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986793756] [2019-11-27 22:36:14,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028948066] [2019-11-27 22:36:14,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,787 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-11-27 22:36:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,810 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-11-27 22:36:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,813 INFO L225 Difference]: With dead ends: 108 [2019-11-27 22:36:14,814 INFO L226 Difference]: Without dead ends: 106 [2019-11-27 22:36:14,816 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:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-27 22:36:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-11-27 22:36:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 22:36:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-11-27 22:36:14,837 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-11-27 22:36:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,839 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-11-27 22:36:14,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-11-27 22:36:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,843 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-11-27 22:36:14,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928327690] [2019-11-27 22:36:14,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,900 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:14,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928327690] [2019-11-27 22:36:14,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776887966] [2019-11-27 22:36:14,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,903 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-11-27 22:36:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,932 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-11-27 22:36:14,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,937 INFO L225 Difference]: With dead ends: 180 [2019-11-27 22:36:14,937 INFO L226 Difference]: Without dead ends: 108 [2019-11-27 22:36:14,938 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:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-27 22:36:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-11-27 22:36:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-27 22:36:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-11-27 22:36:14,949 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-11-27 22:36:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,949 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-11-27 22:36:14,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-11-27 22:36:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,951 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:36:14,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-11-27 22:36:14,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476448800] [2019-11-27 22:36:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,988 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:14,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476448800] [2019-11-27 22:36:14,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319612556] [2019-11-27 22:36:14,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,991 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-11-27 22:36:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,019 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-11-27 22:36:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,021 INFO L225 Difference]: With dead ends: 161 [2019-11-27 22:36:15,022 INFO L226 Difference]: Without dead ends: 110 [2019-11-27 22:36:15,023 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:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-27 22:36:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-27 22:36:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-27 22:36:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-11-27 22:36:15,033 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-11-27 22:36:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,034 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-11-27 22:36:15,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-11-27 22:36:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:15,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,035 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:36:15,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-11-27 22:36:15,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392175752] [2019-11-27 22:36:15,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,091 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:15,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392175752] [2019-11-27 22:36:15,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112237405] [2019-11-27 22:36:15,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,099 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-11-27 22:36:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,131 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-11-27 22:36:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,135 INFO L225 Difference]: With dead ends: 308 [2019-11-27 22:36:15,136 INFO L226 Difference]: Without dead ends: 206 [2019-11-27 22:36:15,138 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:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-27 22:36:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-11-27 22:36:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-27 22:36:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-11-27 22:36:15,170 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-11-27 22:36:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,173 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-11-27 22:36:15,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-11-27 22:36:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:15,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,175 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:36:15,176 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-11-27 22:36:15,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073788617] [2019-11-27 22:36:15,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,236 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:15,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073788617] [2019-11-27 22:36:15,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693833272] [2019-11-27 22:36:15,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,240 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-11-27 22:36:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,274 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-11-27 22:36:15,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,278 INFO L225 Difference]: With dead ends: 256 [2019-11-27 22:36:15,278 INFO L226 Difference]: Without dead ends: 254 [2019-11-27 22:36:15,279 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:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-27 22:36:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-11-27 22:36:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-27 22:36:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-11-27 22:36:15,292 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-11-27 22:36:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,292 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-11-27 22:36:15,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-11-27 22:36:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,294 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:36:15,294 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-11-27 22:36:15,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801788727] [2019-11-27 22:36:15,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,319 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:15,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801788727] [2019-11-27 22:36:15,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741145415] [2019-11-27 22:36:15,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,322 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-11-27 22:36:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,358 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-11-27 22:36:15,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,367 INFO L225 Difference]: With dead ends: 372 [2019-11-27 22:36:15,367 INFO L226 Difference]: Without dead ends: 370 [2019-11-27 22:36:15,368 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:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-27 22:36:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-11-27 22:36:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-27 22:36:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-11-27 22:36:15,388 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-11-27 22:36:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,390 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-11-27 22:36:15,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-11-27 22:36:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,396 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:36:15,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-11-27 22:36:15,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845854325] [2019-11-27 22:36:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,445 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:15,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845854325] [2019-11-27 22:36:15,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148950346] [2019-11-27 22:36:15,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,449 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-11-27 22:36:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,477 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-11-27 22:36:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,481 INFO L225 Difference]: With dead ends: 676 [2019-11-27 22:36:15,481 INFO L226 Difference]: Without dead ends: 394 [2019-11-27 22:36:15,483 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:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-27 22:36:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-11-27 22:36:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-27 22:36:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-11-27 22:36:15,500 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-11-27 22:36:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,501 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-11-27 22:36:15,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-11-27 22:36:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,503 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:36:15,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-11-27 22:36:15,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391347627] [2019-11-27 22:36:15,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,525 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:15,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391347627] [2019-11-27 22:36:15,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239808895] [2019-11-27 22:36:15,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,528 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-11-27 22:36:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,553 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-11-27 22:36:15,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,556 INFO L225 Difference]: With dead ends: 596 [2019-11-27 22:36:15,556 INFO L226 Difference]: Without dead ends: 406 [2019-11-27 22:36:15,557 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:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-27 22:36:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-11-27 22:36:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-11-27 22:36:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-11-27 22:36:15,586 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-11-27 22:36:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,586 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-11-27 22:36:15,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-11-27 22:36:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,589 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:36:15,589 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-11-27 22:36:15,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109942629] [2019-11-27 22:36:15,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,623 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:15,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109942629] [2019-11-27 22:36:15,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205616537] [2019-11-27 22:36:15,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,626 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-11-27 22:36:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,655 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-11-27 22:36:15,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,660 INFO L225 Difference]: With dead ends: 712 [2019-11-27 22:36:15,660 INFO L226 Difference]: Without dead ends: 710 [2019-11-27 22:36:15,662 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:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-27 22:36:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-11-27 22:36:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-27 22:36:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-11-27 22:36:15,686 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-11-27 22:36:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,686 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-11-27 22:36:15,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-11-27 22:36:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,688 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:36:15,688 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-11-27 22:36:15,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826696422] [2019-11-27 22:36:15,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,722 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:15,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826696422] [2019-11-27 22:36:15,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502050820] [2019-11-27 22:36:15,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,724 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-11-27 22:36:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,756 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-11-27 22:36:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,761 INFO L225 Difference]: With dead ends: 1336 [2019-11-27 22:36:15,761 INFO L226 Difference]: Without dead ends: 774 [2019-11-27 22:36:15,762 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:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-27 22:36:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-11-27 22:36:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-27 22:36:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-11-27 22:36:15,791 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-11-27 22:36:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,793 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-11-27 22:36:15,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-11-27 22:36:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:15,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,796 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:36:15,797 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-11-27 22:36:15,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47337171] [2019-11-27 22:36:15,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,825 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:15,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47337171] [2019-11-27 22:36:15,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720121713] [2019-11-27 22:36:15,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,828 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-11-27 22:36:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,853 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-11-27 22:36:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,858 INFO L225 Difference]: With dead ends: 1160 [2019-11-27 22:36:15,858 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:36:15,859 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:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:36:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-11-27 22:36:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-27 22:36:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-11-27 22:36:15,885 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-11-27 22:36:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,886 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-11-27 22:36:15,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-11-27 22:36:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:15,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,888 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:36:15,888 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-11-27 22:36:15,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597763469] [2019-11-27 22:36:15,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,907 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:15,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597763469] [2019-11-27 22:36:15,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271954623] [2019-11-27 22:36:15,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,909 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-11-27 22:36:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,961 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-11-27 22:36:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,968 INFO L225 Difference]: With dead ends: 1352 [2019-11-27 22:36:15,969 INFO L226 Difference]: Without dead ends: 1350 [2019-11-27 22:36:15,971 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:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-27 22:36:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-11-27 22:36:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-27 22:36:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-11-27 22:36:16,010 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-11-27 22:36:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,010 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-11-27 22:36:16,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-11-27 22:36:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:16,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,016 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:36:16,016 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-11-27 22:36:16,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699118487] [2019-11-27 22:36:16,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,056 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:16,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699118487] [2019-11-27 22:36:16,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158416234] [2019-11-27 22:36:16,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,064 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-11-27 22:36:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,119 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-11-27 22:36:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,130 INFO L225 Difference]: With dead ends: 2632 [2019-11-27 22:36:16,130 INFO L226 Difference]: Without dead ends: 1510 [2019-11-27 22:36:16,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-27 22:36:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-11-27 22:36:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-11-27 22:36:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-11-27 22:36:16,210 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-11-27 22:36:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,211 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-11-27 22:36:16,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-11-27 22:36:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:16,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,216 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:36:16,217 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-11-27 22:36:16,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716564281] [2019-11-27 22:36:16,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,255 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:16,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716564281] [2019-11-27 22:36:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868502141] [2019-11-27 22:36:16,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,258 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-11-27 22:36:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,310 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-11-27 22:36:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,323 INFO L225 Difference]: With dead ends: 2264 [2019-11-27 22:36:16,323 INFO L226 Difference]: Without dead ends: 1542 [2019-11-27 22:36:16,326 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:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-27 22:36:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-11-27 22:36:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-27 22:36:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-11-27 22:36:16,395 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-11-27 22:36:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,395 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-11-27 22:36:16,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-11-27 22:36:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:16,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,399 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:36:16,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-11-27 22:36:16,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341850016] [2019-11-27 22:36:16,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,426 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:16,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341850016] [2019-11-27 22:36:16,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244885144] [2019-11-27 22:36:16,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,428 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-11-27 22:36:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,490 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-11-27 22:36:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,504 INFO L225 Difference]: With dead ends: 2568 [2019-11-27 22:36:16,504 INFO L226 Difference]: Without dead ends: 2566 [2019-11-27 22:36:16,506 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:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-11-27 22:36:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-11-27 22:36:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-27 22:36:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-11-27 22:36:16,592 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-11-27 22:36:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,594 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-11-27 22:36:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-11-27 22:36:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:16,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,599 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:36:16,599 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-11-27 22:36:16,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250516324] [2019-11-27 22:36:16,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,620 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:16,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250516324] [2019-11-27 22:36:16,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890685060] [2019-11-27 22:36:16,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,623 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-11-27 22:36:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,725 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-11-27 22:36:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,737 INFO L225 Difference]: With dead ends: 5192 [2019-11-27 22:36:16,738 INFO L226 Difference]: Without dead ends: 2950 [2019-11-27 22:36:16,741 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:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-27 22:36:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-11-27 22:36:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-11-27 22:36:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-11-27 22:36:16,854 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-11-27 22:36:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,854 INFO L462 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-11-27 22:36:16,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-11-27 22:36:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:16,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,859 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:36:16,859 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-11-27 22:36:16,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983644350] [2019-11-27 22:36:16,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,887 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:16,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983644350] [2019-11-27 22:36:16,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420294649] [2019-11-27 22:36:16,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,891 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-11-27 22:36:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,975 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-11-27 22:36:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,995 INFO L225 Difference]: With dead ends: 4424 [2019-11-27 22:36:16,995 INFO L226 Difference]: Without dead ends: 3014 [2019-11-27 22:36:16,998 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:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-11-27 22:36:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-11-27 22:36:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-11-27 22:36:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-11-27 22:36:17,132 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-11-27 22:36:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:17,132 INFO L462 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-11-27 22:36:17,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-11-27 22:36:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:17,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:17,138 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:36:17,139 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-11-27 22:36:17,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:17,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098557920] [2019-11-27 22:36:17,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:17,172 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:17,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098557920] [2019-11-27 22:36:17,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:17,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:17,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945621619] [2019-11-27 22:36:17,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:17,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:17,177 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-11-27 22:36:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:17,277 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-11-27 22:36:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:17,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:17,299 INFO L225 Difference]: With dead ends: 4870 [2019-11-27 22:36:17,300 INFO L226 Difference]: Without dead ends: 4868 [2019-11-27 22:36:17,303 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:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-11-27 22:36:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-11-27 22:36:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-11-27 22:36:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-11-27 22:36:17,439 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-11-27 22:36:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:17,440 INFO L462 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-11-27 22:36:17,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-11-27 22:36:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:17,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:17,449 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:36:17,449 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-11-27 22:36:17,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:17,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060627493] [2019-11-27 22:36:17,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:17,488 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:17,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060627493] [2019-11-27 22:36:17,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:17,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389330539] [2019-11-27 22:36:17,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:17,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:17,492 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-11-27 22:36:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:17,634 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-11-27 22:36:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:17,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:17,637 INFO L225 Difference]: With dead ends: 10244 [2019-11-27 22:36:17,637 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:17,649 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:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:17,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-27 22:36:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:17,651 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:17,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:17,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:17,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:17,675 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-27 22:36:17,675 INFO L242 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-27 22:36:17,676 INFO L246 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,677 INFO L246 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,679 INFO L246 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,680 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-11-27 22:36:17,680 INFO L246 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,680 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-27 22:36:17,680 INFO L249 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-11-27 22:36:17,681 INFO L246 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,681 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-11-27 22:36:17,681 INFO L246 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,681 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:17,682 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-27 22:36:17,682 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-27 22:36:17,682 INFO L246 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,682 INFO L249 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-11-27 22:36:17,683 INFO L246 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,683 INFO L246 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,683 INFO L249 CegarLoopResult]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-11-27 22:36:17,683 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-27 22:36:17,684 INFO L246 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-11-27 22:36:17,684 INFO L246 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-11-27 22:36:17,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:17 BoogieIcfgContainer [2019-11-27 22:36:17,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:17,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:17,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:17,700 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:17,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/4) ... [2019-11-27 22:36:17,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:17,727 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:17,727 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:17,839 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:17,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:17,843 INFO L168 Benchmark]: Toolchain (without parser) took 4767.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 961.7 MB in the beginning and 992.2 MB in the end (delta: -30.5 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,843 INFO L168 Benchmark]: CDTParser took 0.27 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:17,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:17,844 INFO L168 Benchmark]: Boogie Preprocessor took 21.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,845 INFO L168 Benchmark]: RCFGBuilder took 403.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,845 INFO L168 Benchmark]: TraceAbstraction took 3738.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.5 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,846 INFO L168 Benchmark]: Witness Printer took 140.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:17,848 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.27 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 412.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 403.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3738.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.5 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. * Witness Printer took 140.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 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.5s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...