./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_6.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 fc492c809d432e4c3053fa8c39191c1c15ea4eea .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:38,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:38,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:38,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:38,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:38,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:38,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:38,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:38,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:38,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:38,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:38,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:38,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:38,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:38,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:38,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:38,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:38,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:38,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:38,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:38,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:38,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:38,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:38,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:38,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:38,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:38,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:38,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:38,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:38,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:38,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:38,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:38,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:38,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:38,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:38,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:38,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:38,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:38,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:38,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:38,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:38,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:38,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:38,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:38,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:38,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:38,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:38,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:38,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:38,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:38,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:38,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:38,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:38,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:38,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:38,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:38,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:38,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:38,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:38,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:38,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:38,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:38,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:38,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:38,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:38,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:38,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:38,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:38,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:38,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:38,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:38,152 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-28 15:40:38,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:38,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:38,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:38,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:38,478 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:38,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 15:40:38,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ead8921c/abe75b2e0efe4ed389d30fcb5cf097a2/FLAG0543c52a4 [2019-11-28 15:40:39,072 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:39,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2019-11-28 15:40:39,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ead8921c/abe75b2e0efe4ed389d30fcb5cf097a2/FLAG0543c52a4 [2019-11-28 15:40:39,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ead8921c/abe75b2e0efe4ed389d30fcb5cf097a2 [2019-11-28 15:40:39,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:39,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:39,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:39,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:39,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:39,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5562b866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39, skipping insertion in model container [2019-11-28 15:40:39,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:39,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:39,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:39,710 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:39,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:39,804 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:39,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39 WrapperNode [2019-11-28 15:40:39,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:39,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:39,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:39,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:39,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:39,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:39,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:39,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:39,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:39,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:39,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:39,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:39,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:40,285 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:40,285 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:40,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:40 BoogieIcfgContainer [2019-11-28 15:40:40,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:40,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:40,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:40,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:40,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:39" (1/3) ... [2019-11-28 15:40:40,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f55e6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:40, skipping insertion in model container [2019-11-28 15:40:40,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39" (2/3) ... [2019-11-28 15:40:40,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f55e6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:40, skipping insertion in model container [2019-11-28 15:40:40,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:40" (3/3) ... [2019-11-28 15:40:40,297 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-28 15:40:40,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:40,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:40,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:40,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:40,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:40,351 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:40,351 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:40,351 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:40,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:40,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:40,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-28 15:40:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 15:40:40,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:40,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:40,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-11-28 15:40:40,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:40,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723536027] [2019-11-28 15:40:40,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:40,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723536027] [2019-11-28 15:40:40,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:40,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839230372] [2019-11-28 15:40:40,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:40,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,581 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-28 15:40:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:40,669 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-11-28 15:40:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:40,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 15:40:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:40,693 INFO L225 Difference]: With dead ends: 58 [2019-11-28 15:40:40,693 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 15:40:40,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 15:40:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-11-28 15:40:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 15:40:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-11-28 15:40:40,765 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-11-28 15:40:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:40,766 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-11-28 15:40:40,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-11-28 15:40:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 15:40:40,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:40,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:40,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-11-28 15:40:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:40,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599075803] [2019-11-28 15:40:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:40,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599075803] [2019-11-28 15:40:40,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:40,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:40,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142327563] [2019-11-28 15:40:40,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:40,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,871 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-11-28 15:40:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:40,909 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-11-28 15:40:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:40,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 15:40:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:40,913 INFO L225 Difference]: With dead ends: 73 [2019-11-28 15:40:40,913 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 15:40:40,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 15:40:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-28 15:40:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:40:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-11-28 15:40:40,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-11-28 15:40:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:40,927 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-11-28 15:40:40,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-11-28 15:40:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:40:40,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:40,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:40,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-11-28 15:40:40,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:40,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347029959] [2019-11-28 15:40:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:40,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347029959] [2019-11-28 15:40:40,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:40,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:40,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815683960] [2019-11-28 15:40:40,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:40,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,978 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-11-28 15:40:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,005 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-11-28 15:40:41,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:40:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,007 INFO L225 Difference]: With dead ends: 68 [2019-11-28 15:40:41,007 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 15:40:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 15:40:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 15:40:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 15:40:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-11-28 15:40:41,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-11-28 15:40:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,020 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-11-28 15:40:41,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-11-28 15:40:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:40:41,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-11-28 15:40:41,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 15:40:41,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575371549] [2019-11-28 15:40:41,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287985907] [2019-11-28 15:40:41,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,100 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-11-28 15:40:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,132 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-11-28 15:40:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:40:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,134 INFO L225 Difference]: With dead ends: 84 [2019-11-28 15:40:41,135 INFO L226 Difference]: Without dead ends: 82 [2019-11-28 15:40:41,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-28 15:40:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-28 15:40:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-28 15:40:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 15:40:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-11-28 15:40:41,155 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-11-28 15:40:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,156 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-11-28 15:40:41,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-11-28 15:40:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:40:41,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-11-28 15:40:41,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630193183] [2019-11-28 15:40:41,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630193183] [2019-11-28 15:40:41,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584026939] [2019-11-28 15:40:41,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,220 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-11-28 15:40:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,240 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-11-28 15:40:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:40:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,243 INFO L225 Difference]: With dead ends: 140 [2019-11-28 15:40:41,245 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 15:40:41,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 15:40:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-28 15:40:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 15:40:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-11-28 15:40:41,258 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-11-28 15:40:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,258 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-11-28 15:40:41,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-11-28 15:40:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-11-28 15:40:41,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844046773] [2019-11-28 15:40:41,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844046773] [2019-11-28 15:40:41,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306771625] [2019-11-28 15:40:41,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,318 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-11-28 15:40:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,341 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-11-28 15:40:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,343 INFO L225 Difference]: With dead ends: 125 [2019-11-28 15:40:41,343 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 15:40:41,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 15:40:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-28 15:40:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 15:40:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-11-28 15:40:41,352 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-11-28 15:40:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,352 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-11-28 15:40:41,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-11-28 15:40:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,354 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-11-28 15:40:41,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105494950] [2019-11-28 15:40:41,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105494950] [2019-11-28 15:40:41,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418883864] [2019-11-28 15:40:41,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,377 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-11-28 15:40:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,398 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-11-28 15:40:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,400 INFO L225 Difference]: With dead ends: 236 [2019-11-28 15:40:41,400 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 15:40:41,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 15:40:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-28 15:40:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 15:40:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-11-28 15:40:41,415 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-11-28 15:40:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,415 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-11-28 15:40:41,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-11-28 15:40:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-11-28 15:40:41,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40205908] [2019-11-28 15:40:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40205908] [2019-11-28 15:40:41,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339230903] [2019-11-28 15:40:41,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,445 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-11-28 15:40:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,471 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-11-28 15:40:41,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,474 INFO L225 Difference]: With dead ends: 192 [2019-11-28 15:40:41,474 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 15:40:41,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 15:40:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-11-28 15:40:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 15:40:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-11-28 15:40:41,488 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-11-28 15:40:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,488 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-11-28 15:40:41,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-11-28 15:40:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:41,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,490 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-11-28 15:40:41,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980684044] [2019-11-28 15:40:41,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980684044] [2019-11-28 15:40:41,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125515017] [2019-11-28 15:40:41,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,536 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-11-28 15:40:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,564 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-11-28 15:40:41,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,567 INFO L225 Difference]: With dead ends: 276 [2019-11-28 15:40:41,567 INFO L226 Difference]: Without dead ends: 274 [2019-11-28 15:40:41,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-28 15:40:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-11-28 15:40:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 15:40:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-11-28 15:40:41,584 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-11-28 15:40:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,585 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-11-28 15:40:41,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-11-28 15:40:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:41,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-11-28 15:40:41,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877694189] [2019-11-28 15:40:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877694189] [2019-11-28 15:40:41,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83440429] [2019-11-28 15:40:41,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,625 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-11-28 15:40:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,662 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-11-28 15:40:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,667 INFO L225 Difference]: With dead ends: 516 [2019-11-28 15:40:41,668 INFO L226 Difference]: Without dead ends: 298 [2019-11-28 15:40:41,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-28 15:40:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-28 15:40:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-28 15:40:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-11-28 15:40:41,708 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-11-28 15:40:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,710 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-11-28 15:40:41,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-11-28 15:40:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:41,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-11-28 15:40:41,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776887966] [2019-11-28 15:40:41,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776887966] [2019-11-28 15:40:41,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129747087] [2019-11-28 15:40:41,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,768 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-11-28 15:40:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,795 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-11-28 15:40:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,798 INFO L225 Difference]: With dead ends: 452 [2019-11-28 15:40:41,798 INFO L226 Difference]: Without dead ends: 310 [2019-11-28 15:40:41,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-28 15:40:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-11-28 15:40:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-28 15:40:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-11-28 15:40:41,813 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-11-28 15:40:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,813 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-11-28 15:40:41,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-11-28 15:40:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:41,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-11-28 15:40:41,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-28 15:40:41,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319612556] [2019-11-28 15:40:41,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772002563] [2019-11-28 15:40:41,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,850 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-11-28 15:40:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,882 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-11-28 15:40:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,888 INFO L225 Difference]: With dead ends: 520 [2019-11-28 15:40:41,888 INFO L226 Difference]: Without dead ends: 518 [2019-11-28 15:40:41,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-28 15:40:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-11-28 15:40:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-28 15:40:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-11-28 15:40:41,910 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-11-28 15:40:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,911 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-11-28 15:40:41,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-11-28 15:40:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:41,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,913 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-11-28 15:40:41,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982409313] [2019-11-28 15:40:41,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:41,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982409313] [2019-11-28 15:40:41,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751328274] [2019-11-28 15:40:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,958 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-11-28 15:40:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,989 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-11-28 15:40:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,993 INFO L225 Difference]: With dead ends: 1016 [2019-11-28 15:40:41,994 INFO L226 Difference]: Without dead ends: 582 [2019-11-28 15:40:41,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-28 15:40:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-11-28 15:40:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-28 15:40:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-11-28 15:40:42,019 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-11-28 15:40:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,020 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-11-28 15:40:42,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-11-28 15:40:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-11-28 15:40:42,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380435579] [2019-11-28 15:40:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:42,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380435579] [2019-11-28 15:40:42,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506867219] [2019-11-28 15:40:42,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,063 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-11-28 15:40:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,093 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-11-28 15:40:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,097 INFO L225 Difference]: With dead ends: 872 [2019-11-28 15:40:42,097 INFO L226 Difference]: Without dead ends: 598 [2019-11-28 15:40:42,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-28 15:40:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-28 15:40:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-28 15:40:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-11-28 15:40:42,124 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-11-28 15:40:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,125 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-11-28 15:40:42,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-11-28 15:40:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,127 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-11-28 15:40:42,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024234792] [2019-11-28 15:40:42,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:42,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024234792] [2019-11-28 15:40:42,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873225499] [2019-11-28 15:40:42,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,166 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-11-28 15:40:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,199 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-11-28 15:40:42,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,205 INFO L225 Difference]: With dead ends: 966 [2019-11-28 15:40:42,206 INFO L226 Difference]: Without dead ends: 964 [2019-11-28 15:40:42,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-11-28 15:40:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-11-28 15:40:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-28 15:40:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-11-28 15:40:42,241 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-11-28 15:40:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,243 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-11-28 15:40:42,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-11-28 15:40:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-11-28 15:40:42,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217016356] [2019-11-28 15:40:42,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:42,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217016356] [2019-11-28 15:40:42,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692486157] [2019-11-28 15:40:42,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,293 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-11-28 15:40:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,333 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-11-28 15:40:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,335 INFO L225 Difference]: With dead ends: 1988 [2019-11-28 15:40:42,335 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:42,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:42,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 15:40:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,340 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:42,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:42,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:42,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:42,365 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-28 15:40:42,365 INFO L246 CegarLoopResult]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,365 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:42,365 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:42,365 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-28 15:40:42,365 INFO L249 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-28 15:40:42,366 INFO L246 CegarLoopResult]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,367 INFO L249 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-11-28 15:40:42,367 INFO L249 CegarLoopResult]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-11-28 15:40:42,367 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-28 15:40:42,367 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-28 15:40:42,367 INFO L242 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-11-28 15:40:42,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-28 15:40:42,367 INFO L246 CegarLoopResult]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,368 INFO L246 CegarLoopResult]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:42,369 INFO L246 CegarLoopResult]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,369 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-28 15:40:42,371 INFO L246 CegarLoopResult]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,371 INFO L246 CegarLoopResult]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-11-28 15:40:42,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:42 BoogieIcfgContainer [2019-11-28 15:40:42,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:42,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:42,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:42,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:42,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:40" (3/4) ... [2019-11-28 15:40:42,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:42,403 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:42,403 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:42,491 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:42,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:42,495 INFO L168 Benchmark]: Toolchain (without parser) took 3066.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 937.6 MB in the end (delta: 18.7 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:42,497 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:42,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:42,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.21 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-28 15:40:42,498 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 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-28 15:40:42,499 INFO L168 Benchmark]: RCFGBuilder took 419.89 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:42,500 INFO L168 Benchmark]: TraceAbstraction took 2097.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.2 MB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:42,500 INFO L168 Benchmark]: Witness Printer took 106.49 ms. Allocated memory is still 1.2 GB. Free memory was 944.2 MB in the beginning and 937.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:42,503 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.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.21 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 19.82 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. * RCFGBuilder took 419.89 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2097.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.2 MB in the end (delta: 170.2 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. * Witness Printer took 106.49 ms. Allocated memory is still 1.2 GB. Free memory was 944.2 MB in the beginning and 937.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 27]: 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, 27 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 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.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...