./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 5107685577f81a5867811396b2c0a05eb5630c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:44,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:44,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:44,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:44,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:44,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:44,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:44,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:44,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:44,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:44,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:44,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:44,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:44,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:44,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:44,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:44,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:44,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:44,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:44,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:44,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:44,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:44,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:44,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:44,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:44,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:44,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:44,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:44,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:44,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:44,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:44,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:44,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:44,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:44,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:44,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:44,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:44,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:44,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:44,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:44,254 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:44,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:44,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:44,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:44,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:44,305 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:44,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:44,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:44,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:44,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:44,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:44,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:44,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:44,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:44,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:44,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:44,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:44,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:44,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:44,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:44,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:44,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:44,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:44,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:44,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:44,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:44,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:44,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:44,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:44,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:44,319 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-28 15:40:44,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:44,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:44,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:44,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:44,698 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:44,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 15:40:44,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6f2fbc9/f031964a091c4833b2cb90dcc1f75b7a/FLAG646f2647f [2019-11-28 15:40:45,272 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:45,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2019-11-28 15:40:45,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6f2fbc9/f031964a091c4833b2cb90dcc1f75b7a/FLAG646f2647f [2019-11-28 15:40:45,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6f2fbc9/f031964a091c4833b2cb90dcc1f75b7a [2019-11-28 15:40:45,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:45,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:45,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:45,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:45,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:45,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:45" (1/1) ... [2019-11-28 15:40:45,682 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:45, skipping insertion in model container [2019-11-28 15:40:45,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:45" (1/1) ... [2019-11-28 15:40:45,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:45,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:45,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:45,941 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:45,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:45,987 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:45,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:45 WrapperNode [2019-11-28 15:40:45,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:45,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:45,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:45,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:46,007 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:45" (1/1) ... [2019-11-28 15:40:46,078 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:45" (1/1) ... [2019-11-28 15:40:46,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:46,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:46,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:46,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:46,120 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:45" (1/1) ... [2019-11-28 15:40:46,121 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:45" (1/1) ... [2019-11-28 15:40:46,126 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:45" (1/1) ... [2019-11-28 15:40:46,127 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:45" (1/1) ... [2019-11-28 15:40:46,130 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:45" (1/1) ... [2019-11-28 15:40:46,140 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:45" (1/1) ... [2019-11-28 15:40:46,142 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:45" (1/1) ... [2019-11-28 15:40:46,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:46,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:46,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:46,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:46,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:45" (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:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:46,527 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:46,527 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:46,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:46 BoogieIcfgContainer [2019-11-28 15:40:46,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:46,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:46,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:46,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:46,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:45" (1/3) ... [2019-11-28 15:40:46,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfe17fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:46, skipping insertion in model container [2019-11-28 15:40:46,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:45" (2/3) ... [2019-11-28 15:40:46,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfe17fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:46, skipping insertion in model container [2019-11-28 15:40:46,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:46" (3/3) ... [2019-11-28 15:40:46,547 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-11-28 15:40:46,571 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:46,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:46,594 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:46,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:46,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:46,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:46,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:46,621 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:46,621 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:46,621 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:46,621 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-28 15:40:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:46,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:46,643 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:46,643 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-11-28 15:40:46,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:46,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195360043] [2019-11-28 15:40:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:46,847 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:46,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195360043] [2019-11-28 15:40:46,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:46,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:46,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405356821] [2019-11-28 15:40:46,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:46,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:46,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:46,875 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-28 15:40:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:46,927 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-11-28 15:40:46,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:46,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:46,942 INFO L225 Difference]: With dead ends: 76 [2019-11-28 15:40:46,943 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 15:40:46,946 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:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 15:40:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-28 15:40:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 15:40:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-11-28 15:40:46,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-11-28 15:40:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:46,987 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-11-28 15:40:46,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-11-28 15:40:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:46,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:46,989 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:46,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-11-28 15:40:46,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:46,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771808516] [2019-11-28 15:40:46,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,047 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:47,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771808516] [2019-11-28 15:40:47,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656327409] [2019-11-28 15:40:47,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,051 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-11-28 15:40:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,077 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-11-28 15:40:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,080 INFO L225 Difference]: With dead ends: 103 [2019-11-28 15:40:47,080 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 15:40:47,082 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:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 15:40:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-28 15:40:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 15:40:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-11-28 15:40:47,092 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-11-28 15:40:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,093 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-11-28 15:40:47,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-11-28 15:40:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:47,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,095 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:47,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-11-28 15:40:47,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009439165] [2019-11-28 15:40:47,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,150 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:47,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009439165] [2019-11-28 15:40:47,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907531099] [2019-11-28 15:40:47,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,153 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-11-28 15:40:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,189 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-11-28 15:40:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,196 INFO L225 Difference]: With dead ends: 95 [2019-11-28 15:40:47,197 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 15:40:47,198 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:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 15:40:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-28 15:40:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 15:40:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-11-28 15:40:47,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-11-28 15:40:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,208 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-11-28 15:40:47,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-11-28 15:40:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:47,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,210 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:47,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-11-28 15:40:47,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987978275] [2019-11-28 15:40:47,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,299 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:47,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987978275] [2019-11-28 15:40:47,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113541245] [2019-11-28 15:40:47,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,303 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-11-28 15:40:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,331 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-28 15:40:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,334 INFO L225 Difference]: With dead ends: 120 [2019-11-28 15:40:47,334 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 15:40:47,335 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:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 15:40:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-11-28 15:40:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 15:40:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-11-28 15:40:47,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-11-28 15:40:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,356 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-11-28 15:40:47,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-11-28 15:40:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:47,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,360 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:47,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-11-28 15:40:47,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42901625] [2019-11-28 15:40:47,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,430 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:47,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42901625] [2019-11-28 15:40:47,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186848732] [2019-11-28 15:40:47,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,434 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-11-28 15:40:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,459 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-11-28 15:40:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,461 INFO L225 Difference]: With dead ends: 200 [2019-11-28 15:40:47,461 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 15:40:47,462 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:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 15:40:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-11-28 15:40:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 15:40:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-11-28 15:40:47,481 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-11-28 15:40:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,482 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-11-28 15:40:47,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-11-28 15:40:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:47,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,484 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:47,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-11-28 15:40:47,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323200456] [2019-11-28 15:40:47,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,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:47,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323200456] [2019-11-28 15:40:47,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110412870] [2019-11-28 15:40:47,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,536 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-11-28 15:40:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,567 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-11-28 15:40:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,569 INFO L225 Difference]: With dead ends: 179 [2019-11-28 15:40:47,569 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 15:40:47,570 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:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 15:40:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-28 15:40:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 15:40:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-11-28 15:40:47,592 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-11-28 15:40:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,593 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-11-28 15:40:47,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-11-28 15:40:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:47,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,595 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:47,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-11-28 15:40:47,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841178966] [2019-11-28 15:40:47,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,637 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:47,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841178966] [2019-11-28 15:40:47,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188612767] [2019-11-28 15:40:47,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,640 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-11-28 15:40:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,679 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-11-28 15:40:47,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,681 INFO L225 Difference]: With dead ends: 344 [2019-11-28 15:40:47,681 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 15:40:47,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 15:40:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-11-28 15:40:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-28 15:40:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-11-28 15:40:47,699 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-11-28 15:40:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,700 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-11-28 15:40:47,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-11-28 15:40:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:47,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:47,702 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-11-28 15:40:47,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990724475] [2019-11-28 15:40:47,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,759 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:47,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990724475] [2019-11-28 15:40:47,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773402724] [2019-11-28 15:40:47,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,762 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-11-28 15:40:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,791 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-11-28 15:40:47,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,797 INFO L225 Difference]: With dead ends: 288 [2019-11-28 15:40:47,797 INFO L226 Difference]: Without dead ends: 286 [2019-11-28 15:40:47,798 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:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-28 15:40:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-11-28 15:40:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-28 15:40:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-11-28 15:40:47,810 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-11-28 15:40:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,810 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-11-28 15:40:47,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-11-28 15:40:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:47,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:47,813 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-11-28 15:40:47,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320175762] [2019-11-28 15:40:47,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:47,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:47,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320175762] [2019-11-28 15:40:47,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:47,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:47,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506029161] [2019-11-28 15:40:47,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:47,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:47,852 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-11-28 15:40:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:47,888 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-11-28 15:40:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:47,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:47,895 INFO L225 Difference]: With dead ends: 420 [2019-11-28 15:40:47,895 INFO L226 Difference]: Without dead ends: 418 [2019-11-28 15:40:47,896 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:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-28 15:40:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-11-28 15:40:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-28 15:40:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-11-28 15:40:47,926 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-11-28 15:40:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:47,927 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-11-28 15:40:47,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-11-28 15:40:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:47,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:47,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:47,939 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:47,939 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-11-28 15:40:47,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:47,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720958910] [2019-11-28 15:40:47,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,001 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:48,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720958910] [2019-11-28 15:40:48,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653323201] [2019-11-28 15:40:48,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,004 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-11-28 15:40:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,027 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-11-28 15:40:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,031 INFO L225 Difference]: With dead ends: 756 [2019-11-28 15:40:48,031 INFO L226 Difference]: Without dead ends: 442 [2019-11-28 15:40:48,032 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:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-28 15:40:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-28 15:40:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-28 15:40:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-11-28 15:40:48,062 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-11-28 15:40:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,062 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-11-28 15:40:48,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-11-28 15:40:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:48,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,065 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-11-28 15:40:48,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974389051] [2019-11-28 15:40:48,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,098 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:48,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974389051] [2019-11-28 15:40:48,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731686666] [2019-11-28 15:40:48,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,101 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-11-28 15:40:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,133 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-11-28 15:40:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,138 INFO L225 Difference]: With dead ends: 668 [2019-11-28 15:40:48,138 INFO L226 Difference]: Without dead ends: 454 [2019-11-28 15:40:48,140 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:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-28 15:40:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-11-28 15:40:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-28 15:40:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-11-28 15:40:48,164 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-11-28 15:40:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,164 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-11-28 15:40:48,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-11-28 15:40:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:48,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-11-28 15:40:48,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597222355] [2019-11-28 15:40:48,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597222355] [2019-11-28 15:40:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721638343] [2019-11-28 15:40:48,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,207 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-11-28 15:40:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,238 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-11-28 15:40:48,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,246 INFO L225 Difference]: With dead ends: 808 [2019-11-28 15:40:48,246 INFO L226 Difference]: Without dead ends: 806 [2019-11-28 15:40:48,247 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:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-11-28 15:40:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-11-28 15:40:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-28 15:40:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-11-28 15:40:48,274 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-11-28 15:40:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-11-28 15:40:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-11-28 15:40:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:48,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,277 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-11-28 15:40:48,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927872402] [2019-11-28 15:40:48,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,309 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:48,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927872402] [2019-11-28 15:40:48,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579700656] [2019-11-28 15:40:48,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,313 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-11-28 15:40:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,347 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-11-28 15:40:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,354 INFO L225 Difference]: With dead ends: 1496 [2019-11-28 15:40:48,355 INFO L226 Difference]: Without dead ends: 870 [2019-11-28 15:40:48,356 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:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-28 15:40:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-11-28 15:40:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-28 15:40:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-11-28 15:40:48,389 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-11-28 15:40:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,389 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-11-28 15:40:48,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-11-28 15:40:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:48,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,395 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-11-28 15:40:48,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589207496] [2019-11-28 15:40:48,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,429 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:48,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589207496] [2019-11-28 15:40:48,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105093781] [2019-11-28 15:40:48,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,432 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-11-28 15:40:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,460 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-11-28 15:40:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,465 INFO L225 Difference]: With dead ends: 1304 [2019-11-28 15:40:48,466 INFO L226 Difference]: Without dead ends: 886 [2019-11-28 15:40:48,467 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:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-28 15:40:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-11-28 15:40:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-11-28 15:40:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-11-28 15:40:48,497 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-11-28 15:40:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,497 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-11-28 15:40:48,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-11-28 15:40:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:48,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,500 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-11-28 15:40:48,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481857931] [2019-11-28 15:40:48,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,522 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:48,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481857931] [2019-11-28 15:40:48,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832049557] [2019-11-28 15:40:48,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,524 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-11-28 15:40:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,557 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-11-28 15:40:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,566 INFO L225 Difference]: With dead ends: 1544 [2019-11-28 15:40:48,566 INFO L226 Difference]: Without dead ends: 1542 [2019-11-28 15:40:48,567 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:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-28 15:40:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-11-28 15:40:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-28 15:40:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-11-28 15:40:48,614 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-11-28 15:40:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,614 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-11-28 15:40:48,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-11-28 15:40:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:48,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,618 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-11-28 15:40:48,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564437357] [2019-11-28 15:40:48,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,636 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:48,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564437357] [2019-11-28 15:40:48,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716564281] [2019-11-28 15:40:48,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,639 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-11-28 15:40:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,687 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-11-28 15:40:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,699 INFO L225 Difference]: With dead ends: 2952 [2019-11-28 15:40:48,699 INFO L226 Difference]: Without dead ends: 1702 [2019-11-28 15:40:48,702 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:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-11-28 15:40:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-11-28 15:40:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-28 15:40:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-11-28 15:40:48,783 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-11-28 15:40:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,783 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-11-28 15:40:48,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-11-28 15:40:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:48,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,788 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-11-28 15:40:48,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223137866] [2019-11-28 15:40:48,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,814 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:48,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223137866] [2019-11-28 15:40:48,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450004060] [2019-11-28 15:40:48,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,817 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-11-28 15:40:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:48,865 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-11-28 15:40:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:48,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:48,876 INFO L225 Difference]: With dead ends: 2552 [2019-11-28 15:40:48,877 INFO L226 Difference]: Without dead ends: 1734 [2019-11-28 15:40:48,879 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:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-28 15:40:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-11-28 15:40:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-11-28 15:40:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-11-28 15:40:48,950 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-11-28 15:40:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:48,950 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-11-28 15:40:48,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-11-28 15:40:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:48,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:48,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:48,955 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-11-28 15:40:48,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:48,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731225098] [2019-11-28 15:40:48,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:48,980 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:48,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731225098] [2019-11-28 15:40:48,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:48,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:48,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250516324] [2019-11-28 15:40:48,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:48,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:48,983 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-11-28 15:40:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:49,041 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-11-28 15:40:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:49,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:49,058 INFO L225 Difference]: With dead ends: 2952 [2019-11-28 15:40:49,059 INFO L226 Difference]: Without dead ends: 2950 [2019-11-28 15:40:49,061 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:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-28 15:40:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-11-28 15:40:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-11-28 15:40:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-11-28 15:40:49,206 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-11-28 15:40:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:49,206 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-11-28 15:40:49,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-11-28 15:40:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:49,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:49,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:49,211 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-11-28 15:40:49,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:49,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978663958] [2019-11-28 15:40:49,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:49,231 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:49,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978663958] [2019-11-28 15:40:49,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:49,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:49,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051149036] [2019-11-28 15:40:49,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:49,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:49,233 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-11-28 15:40:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:49,308 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-11-28 15:40:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:49,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:49,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:49,325 INFO L225 Difference]: With dead ends: 5832 [2019-11-28 15:40:49,325 INFO L226 Difference]: Without dead ends: 3334 [2019-11-28 15:40:49,330 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:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-28 15:40:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-11-28 15:40:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-28 15:40:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-11-28 15:40:49,476 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-11-28 15:40:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:49,476 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-11-28 15:40:49,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-11-28 15:40:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:49,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:49,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:49,482 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-11-28 15:40:49,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:49,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834066732] [2019-11-28 15:40:49,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:49,508 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:49,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834066732] [2019-11-28 15:40:49,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:49,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:49,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687738321] [2019-11-28 15:40:49,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:49,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:49,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:49,510 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-11-28 15:40:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:49,598 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-11-28 15:40:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:49,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:49,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:49,619 INFO L225 Difference]: With dead ends: 5000 [2019-11-28 15:40:49,619 INFO L226 Difference]: Without dead ends: 3398 [2019-11-28 15:40:49,623 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:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-28 15:40:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-11-28 15:40:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-11-28 15:40:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-11-28 15:40:49,742 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-11-28 15:40:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:49,743 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-11-28 15:40:49,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-11-28 15:40:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:49,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:49,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:49,748 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-11-28 15:40:49,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:49,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476559826] [2019-11-28 15:40:49,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:49,779 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:49,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476559826] [2019-11-28 15:40:49,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:49,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:49,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773408954] [2019-11-28 15:40:49,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:49,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:49,781 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-11-28 15:40:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:49,880 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-11-28 15:40:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:49,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:49,928 INFO L225 Difference]: With dead ends: 5640 [2019-11-28 15:40:49,929 INFO L226 Difference]: Without dead ends: 5638 [2019-11-28 15:40:49,931 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:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-28 15:40:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-11-28 15:40:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-11-28 15:40:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-11-28 15:40:50,081 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-11-28 15:40:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:50,081 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-11-28 15:40:50,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-11-28 15:40:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:50,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:50,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:50,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-11-28 15:40:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:50,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877349543] [2019-11-28 15:40:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:50,110 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:50,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877349543] [2019-11-28 15:40:50,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:50,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:50,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667531234] [2019-11-28 15:40:50,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:50,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:50,112 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-11-28 15:40:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:50,247 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-11-28 15:40:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:50,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:50,267 INFO L225 Difference]: With dead ends: 11528 [2019-11-28 15:40:50,267 INFO L226 Difference]: Without dead ends: 6534 [2019-11-28 15:40:50,277 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:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-11-28 15:40:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-11-28 15:40:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-11-28 15:40:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-11-28 15:40:50,537 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-11-28 15:40:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:50,537 INFO L462 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-11-28 15:40:50,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-11-28 15:40:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:50,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:50,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:50,549 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-11-28 15:40:50,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:50,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010194180] [2019-11-28 15:40:50,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:50,568 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:50,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010194180] [2019-11-28 15:40:50,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:50,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:50,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349965587] [2019-11-28 15:40:50,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:50,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:50,570 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-11-28 15:40:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:50,714 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-11-28 15:40:50,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:50,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:50,728 INFO L225 Difference]: With dead ends: 9800 [2019-11-28 15:40:50,729 INFO L226 Difference]: Without dead ends: 6662 [2019-11-28 15:40:50,735 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:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-11-28 15:40:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-11-28 15:40:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-28 15:40:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-11-28 15:40:51,004 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-11-28 15:40:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:51,004 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-11-28 15:40:51,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-11-28 15:40:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:51,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:51,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:51,013 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-11-28 15:40:51,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:51,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716050418] [2019-11-28 15:40:51,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:51,034 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:51,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716050418] [2019-11-28 15:40:51,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:51,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:51,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490767786] [2019-11-28 15:40:51,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:51,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:51,037 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-11-28 15:40:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:51,183 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-11-28 15:40:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:51,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:51,203 INFO L225 Difference]: With dead ends: 10758 [2019-11-28 15:40:51,203 INFO L226 Difference]: Without dead ends: 10756 [2019-11-28 15:40:51,209 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:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-11-28 15:40:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-11-28 15:40:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-11-28 15:40:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-11-28 15:40:51,431 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-11-28 15:40:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:51,431 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-11-28 15:40:51,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-11-28 15:40:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:51,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:51,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:51,448 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-11-28 15:40:51,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:51,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891168740] [2019-11-28 15:40:51,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:51,471 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:51,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891168740] [2019-11-28 15:40:51,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:51,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:51,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133030921] [2019-11-28 15:40:51,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:51,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:51,474 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-11-28 15:40:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:51,683 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-11-28 15:40:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:51,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:51,684 INFO L225 Difference]: With dead ends: 22788 [2019-11-28 15:40:51,684 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:51,706 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:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:51,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-28 15:40:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:51,708 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:51,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:51,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:51,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-28 15:40:51,728 INFO L246 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-28 15:40:51,729 INFO L249 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-11-28 15:40:51,729 INFO L246 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,730 INFO L249 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-11-28 15:40:51,730 INFO L246 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,731 INFO L246 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,732 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-11-28 15:40:51,732 INFO L249 CegarLoopResult]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-11-28 15:40:51,732 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-28 15:40:51,732 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L242 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,733 INFO L246 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-11-28 15:40:51,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:51 BoogieIcfgContainer [2019-11-28 15:40:51,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:51,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:51,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:51,752 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:51,752 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:46" (3/4) ... [2019-11-28 15:40:51,756 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:51,776 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:51,777 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:51,883 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:51,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:51,886 INFO L168 Benchmark]: Toolchain (without parser) took 6213.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -66.3 MB). Peak memory consumption was 243.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,887 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:51,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,888 INFO L168 Benchmark]: Boogie Preprocessor took 32.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,888 INFO L168 Benchmark]: RCFGBuilder took 383.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,889 INFO L168 Benchmark]: TraceAbstraction took 5220.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,889 INFO L168 Benchmark]: Witness Printer took 132.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:51,892 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 383.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5220.95 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. * Witness Printer took 132.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...