java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:50,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:50,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:50,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:50,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:50,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:50,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:50,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:50,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:50,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:50,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:50,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:50,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:50,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:50,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:51,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:51,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:51,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:51,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:51,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:51,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:51,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:51,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:51,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:51,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:51,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:51,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:51,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:51,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:51,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:51,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:51,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:51,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:51,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:51,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:51,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:51,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:51,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:51,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:51,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:51,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:51,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:14:51,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:51,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:51,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:51,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:51,062 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:51,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:51,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:51,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:51,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:51,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:51,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:51,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:51,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:51,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:51,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:51,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:51,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:51,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:51,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:51,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:51,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:51,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:51,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:51,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:51,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:51,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:51,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:51,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:51,368 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:51,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-10-13 19:14:51,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f54c2361/53957cbbb41843f8bbdde6d9448391a1/FLAG0df69d793 [2019-10-13 19:14:51,912 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:51,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-13 19:14:51,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f54c2361/53957cbbb41843f8bbdde6d9448391a1/FLAG0df69d793 [2019-10-13 19:14:52,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f54c2361/53957cbbb41843f8bbdde6d9448391a1 [2019-10-13 19:14:52,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:52,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:52,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:52,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:52,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:52,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709a20b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52, skipping insertion in model container [2019-10-13 19:14:52,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:52,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:52,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:52,571 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:52,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:52,606 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:52,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52 WrapperNode [2019-10-13 19:14:52,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:52,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:52,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:52,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:52,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:52,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:52,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:52,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:52,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (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-10-13 19:14:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:53,062 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:53,063 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:53,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53 BoogieIcfgContainer [2019-10-13 19:14:53,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:53,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:53,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:53,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:53,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:52" (1/3) ... [2019-10-13 19:14:53,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daef52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (2/3) ... [2019-10-13 19:14:53,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daef52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53" (3/3) ... [2019-10-13 19:14:53,072 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-13 19:14:53,085 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:53,100 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:53,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:53,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:53,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:53,135 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:53,135 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:53,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:53,136 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:53,136 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:53,136 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-13 19:14:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:14:53,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-13 19:14:53,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365733414] [2019-10-13 19:14:53,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365733414] [2019-10-13 19:14:53,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343997698] [2019-10-13 19:14:53,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-13 19:14:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,413 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-10-13 19:14:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 19:14:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,428 INFO L225 Difference]: With dead ends: 63 [2019-10-13 19:14:53,429 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 19:14:53,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 19:14:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-13 19:14:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 19:14:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-13 19:14:53,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-13 19:14:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,484 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-13 19:14:53,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-13 19:14:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:14:53,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,486 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-13 19:14:53,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699253860] [2019-10-13 19:14:53,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699253860] [2019-10-13 19:14:53,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543141389] [2019-10-13 19:14:53,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,590 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-13 19:14:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,647 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-10-13 19:14:53,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 19:14:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,651 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:14:53,652 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 19:14:53,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 19:14:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-13 19:14:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:14:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-13 19:14:53,673 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-13 19:14:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,673 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-13 19:14:53,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-13 19:14:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,676 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-13 19:14:53,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973192103] [2019-10-13 19:14:53,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973192103] [2019-10-13 19:14:53,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998525613] [2019-10-13 19:14:53,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,750 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-13 19:14:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,783 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-10-13 19:14:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,788 INFO L225 Difference]: With dead ends: 72 [2019-10-13 19:14:53,788 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 19:14:53,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 19:14:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-13 19:14:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 19:14:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-13 19:14:53,803 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-13 19:14:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,804 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-13 19:14:53,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-13 19:14:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,809 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-13 19:14:53,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313375423] [2019-10-13 19:14:53,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313375423] [2019-10-13 19:14:53,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284931541] [2019-10-13 19:14:53,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,898 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-13 19:14:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,933 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-10-13 19:14:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,937 INFO L225 Difference]: With dead ends: 88 [2019-10-13 19:14:53,937 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 19:14:53,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 19:14:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-13 19:14:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 19:14:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-13 19:14:53,951 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-13 19:14:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,951 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-13 19:14:53,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-13 19:14:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,954 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-13 19:14:53,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556367370] [2019-10-13 19:14:53,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556367370] [2019-10-13 19:14:54,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049841342] [2019-10-13 19:14:54,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,024 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-13 19:14:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,062 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-10-13 19:14:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,064 INFO L225 Difference]: With dead ends: 144 [2019-10-13 19:14:54,064 INFO L226 Difference]: Without dead ends: 88 [2019-10-13 19:14:54,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-13 19:14:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-13 19:14:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 19:14:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-13 19:14:54,078 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-13 19:14:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,079 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-13 19:14:54,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-13 19:14:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,084 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-13 19:14:54,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653191806] [2019-10-13 19:14:54,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653191806] [2019-10-13 19:14:54,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137462445] [2019-10-13 19:14:54,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,143 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-13 19:14:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,172 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-10-13 19:14:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,174 INFO L225 Difference]: With dead ends: 129 [2019-10-13 19:14:54,175 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 19:14:54,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 19:14:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-13 19:14:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 19:14:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-13 19:14:54,185 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-13 19:14:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,185 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-13 19:14:54,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-13 19:14:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-13 19:14:54,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870129380] [2019-10-13 19:14:54,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,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-10-13 19:14:54,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870129380] [2019-10-13 19:14:54,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728859093] [2019-10-13 19:14:54,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,236 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-13 19:14:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,263 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-10-13 19:14:54,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,266 INFO L225 Difference]: With dead ends: 156 [2019-10-13 19:14:54,266 INFO L226 Difference]: Without dead ends: 154 [2019-10-13 19:14:54,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-13 19:14:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-13 19:14:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 19:14:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-13 19:14:54,295 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-13 19:14:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,295 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-13 19:14:54,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-13 19:14:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,299 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-13 19:14:54,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765563623] [2019-10-13 19:14:54,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765563623] [2019-10-13 19:14:54,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854041755] [2019-10-13 19:14:54,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,341 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-13 19:14:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,379 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-10-13 19:14:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,382 INFO L225 Difference]: With dead ends: 272 [2019-10-13 19:14:54,382 INFO L226 Difference]: Without dead ends: 162 [2019-10-13 19:14:54,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-13 19:14:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-13 19:14:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-13 19:14:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-13 19:14:54,430 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-13 19:14:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,430 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-13 19:14:54,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-13 19:14:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-13 19:14:54,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165161532] [2019-10-13 19:14:54,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165161532] [2019-10-13 19:14:54,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627011249] [2019-10-13 19:14:54,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,468 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-13 19:14:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,494 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-10-13 19:14:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,496 INFO L225 Difference]: With dead ends: 240 [2019-10-13 19:14:54,496 INFO L226 Difference]: Without dead ends: 166 [2019-10-13 19:14:54,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-13 19:14:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-13 19:14:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-13 19:14:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-13 19:14:54,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-13 19:14:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,511 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-13 19:14:54,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-13 19:14:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,513 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-13 19:14:54,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546610754] [2019-10-13 19:14:54,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546610754] [2019-10-13 19:14:54,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625480878] [2019-10-13 19:14:54,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,544 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-13 19:14:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,566 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-10-13 19:14:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,568 INFO L225 Difference]: With dead ends: 284 [2019-10-13 19:14:54,568 INFO L226 Difference]: Without dead ends: 282 [2019-10-13 19:14:54,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-13 19:14:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-13 19:14:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 19:14:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-13 19:14:54,579 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-13 19:14:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,579 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-13 19:14:54,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-13 19:14:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,581 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,581 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-13 19:14:54,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421902037] [2019-10-13 19:14:54,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421902037] [2019-10-13 19:14:54,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998545282] [2019-10-13 19:14:54,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,605 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-13 19:14:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,628 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-10-13 19:14:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,631 INFO L225 Difference]: With dead ends: 524 [2019-10-13 19:14:54,631 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:14:54,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:14:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 19:14:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:14:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-13 19:14:54,644 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-13 19:14:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,644 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-13 19:14:54,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-13 19:14:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,646 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-13 19:14:54,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482844331] [2019-10-13 19:14:54,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482844331] [2019-10-13 19:14:54,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262487543] [2019-10-13 19:14:54,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,675 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-13 19:14:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,696 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-10-13 19:14:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,698 INFO L225 Difference]: With dead ends: 456 [2019-10-13 19:14:54,698 INFO L226 Difference]: Without dead ends: 314 [2019-10-13 19:14:54,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-13 19:14:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-13 19:14:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-13 19:14:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-13 19:14:54,717 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-13 19:14:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,717 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-13 19:14:54,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-13 19:14:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-13 19:14:54,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510419774] [2019-10-13 19:14:54,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510419774] [2019-10-13 19:14:54,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623307721] [2019-10-13 19:14:54,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,778 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-13 19:14:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,813 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-10-13 19:14:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,817 INFO L225 Difference]: With dead ends: 524 [2019-10-13 19:14:54,817 INFO L226 Difference]: Without dead ends: 522 [2019-10-13 19:14:54,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-13 19:14:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-13 19:14:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 19:14:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-13 19:14:54,839 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-13 19:14:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,839 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-13 19:14:54,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-13 19:14:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,845 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-13 19:14:54,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386033217] [2019-10-13 19:14:54,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386033217] [2019-10-13 19:14:54,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697531462] [2019-10-13 19:14:54,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,877 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-13 19:14:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,907 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-10-13 19:14:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,912 INFO L225 Difference]: With dead ends: 1020 [2019-10-13 19:14:54,912 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 19:14:54,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 19:14:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-13 19:14:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 19:14:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-13 19:14:54,935 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-13 19:14:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,935 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-13 19:14:54,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-13 19:14:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:54,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,938 INFO L380 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-10-13 19:14:54,938 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-13 19:14:54,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397472831] [2019-10-13 19:14:54,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397472831] [2019-10-13 19:14:54,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031388309] [2019-10-13 19:14:54,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,975 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-13 19:14:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,004 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-10-13 19:14:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,009 INFO L225 Difference]: With dead ends: 876 [2019-10-13 19:14:55,009 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 19:14:55,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 19:14:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-13 19:14:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 19:14:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-13 19:14:55,032 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-13 19:14:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,033 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-13 19:14:55,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-13 19:14:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:55,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,035 INFO L380 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-10-13 19:14:55,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-13 19:14:55,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703711998] [2019-10-13 19:14:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703711998] [2019-10-13 19:14:55,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584311426] [2019-10-13 19:14:55,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,067 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-13 19:14:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,100 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-10-13 19:14:55,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,105 INFO L225 Difference]: With dead ends: 970 [2019-10-13 19:14:55,106 INFO L226 Difference]: Without dead ends: 968 [2019-10-13 19:14:55,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-13 19:14:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-13 19:14:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 19:14:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-13 19:14:55,138 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-13 19:14:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,139 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-13 19:14:55,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-13 19:14:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:55,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,141 INFO L380 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-10-13 19:14:55,142 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-13 19:14:55,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306559259] [2019-10-13 19:14:55,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306559259] [2019-10-13 19:14:55,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940564271] [2019-10-13 19:14:55,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,165 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-13 19:14:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,212 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-10-13 19:14:55,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,214 INFO L225 Difference]: With dead ends: 1992 [2019-10-13 19:14:55,214 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:55,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:55,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-13 19:14:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,220 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:55,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:55,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:55,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:55,249 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,250 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,250 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,250 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-13 19:14:55,250 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-13 19:14:55,251 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,251 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-13 19:14:55,251 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-13 19:14:55,251 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-13 19:14:55,251 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,251 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,252 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-13 19:14:55,252 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-13 19:14:55,253 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,253 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-13 19:14:55,253 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-13 19:14:55,253 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-13 19:14:55,253 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-13 19:14:55,267 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,267 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,267 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,267 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-13 19:14:55,267 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,268 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 19:14:55,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:55 BoogieIcfgContainer [2019-10-13 19:14:55,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:55,278 INFO L168 Benchmark]: Toolchain (without parser) took 2966.51 ms. Allocated memory was 139.5 MB in the beginning and 243.8 MB in the end (delta: 104.3 MB). Free memory was 103.0 MB in the beginning and 216.3 MB in the end (delta: -113.2 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,279 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.96 ms. Allocated memory is still 139.5 MB. Free memory was 102.8 MB in the beginning and 92.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,281 INFO L168 Benchmark]: Boogie Preprocessor took 122.43 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 181.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,281 INFO L168 Benchmark]: RCFGBuilder took 334.05 ms. Allocated memory is still 202.9 MB. Free memory was 181.0 MB in the beginning and 166.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,282 INFO L168 Benchmark]: TraceAbstraction took 2210.41 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 165.6 MB in the beginning and 216.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 111.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,286 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.26 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.96 ms. Allocated memory is still 139.5 MB. Free memory was 102.8 MB in the beginning and 92.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.43 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 181.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.05 ms. Allocated memory is still 202.9 MB. Free memory was 181.0 MB in the beginning and 166.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2210.41 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 165.6 MB in the beginning and 216.3 MB in the end (delta: -50.7 MB). Peak memory consumption was 111.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 2.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...