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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:01,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:01,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:01,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:01,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:01,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:01,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:01,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:01,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:01,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:01,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:01,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:01,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:01,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:01,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:01,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:01,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:01,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:01,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:01,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:01,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:01,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:01,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:01,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:01,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:01,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:01,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:01,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:01,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:01,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:01,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:01,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:01,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:01,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:01,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:01,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:01,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:01,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:01,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:01,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:01,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:01,417 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-15 01:05:01,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:01,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:01,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:01,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:01,440 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:01,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:01,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:01,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:01,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:01,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:01,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:01,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:01,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:01,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:01,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:01,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:01,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:01,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:01,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:01,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:01,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:01,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:01,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:01,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:01,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:01,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:01,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:01,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:01,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:01,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:01,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:01,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:01,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:01,723 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:01,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 01:05:01,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d97f0a88/865a15d0369a4db193878c88ed08e300/FLAG87b73afed [2019-10-15 01:05:02,267 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:02,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 01:05:02,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d97f0a88/865a15d0369a4db193878c88ed08e300/FLAG87b73afed [2019-10-15 01:05:02,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d97f0a88/865a15d0369a4db193878c88ed08e300 [2019-10-15 01:05:02,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:02,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:02,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:02,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:02,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:02,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18910f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02, skipping insertion in model container [2019-10-15 01:05:02,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,625 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:02,670 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:02,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:02,919 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:02,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:02,978 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:02,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02 WrapperNode [2019-10-15 01:05:02,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:02,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:02,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:02,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:03,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:03,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:03,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:03,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:03,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:03,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (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-15 01:05:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:03,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:03,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:03,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:03,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:03,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:03,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:03,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:03,648 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:03,648 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:05:03,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:03 BoogieIcfgContainer [2019-10-15 01:05:03,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:03,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:03,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:03,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:03,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:02" (1/3) ... [2019-10-15 01:05:03,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90eeeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:03, skipping insertion in model container [2019-10-15 01:05:03,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (2/3) ... [2019-10-15 01:05:03,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90eeeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:03, skipping insertion in model container [2019-10-15 01:05:03,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:03" (3/3) ... [2019-10-15 01:05:03,664 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 01:05:03,675 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:03,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-15 01:05:03,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-15 01:05:03,721 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:03,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:03,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:03,722 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:03,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:03,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:03,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:03,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-15 01:05:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:03,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,750 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-15 01:05:03,752 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-10-15 01:05:03,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773554393] [2019-10-15 01:05:03,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,946 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-15 01:05:03,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773554393] [2019-10-15 01:05:03,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:03,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43076998] [2019-10-15 01:05:03,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:03,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:03,973 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-10-15 01:05:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,013 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-10-15 01:05:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:04,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:05:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,027 INFO L225 Difference]: With dead ends: 93 [2019-10-15 01:05:04,028 INFO L226 Difference]: Without dead ends: 80 [2019-10-15 01:05:04,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-15 01:05:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-15 01:05:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-15 01:05:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-15 01:05:04,084 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-10-15 01:05:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,085 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-15 01:05:04,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-15 01:05:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:05:04,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,089 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-15 01:05:04,093 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-10-15 01:05:04,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726299525] [2019-10-15 01:05:04,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,232 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-15 01:05:04,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726299525] [2019-10-15 01:05:04,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:04,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095272055] [2019-10-15 01:05:04,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:04,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:04,238 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-10-15 01:05:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,349 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-10-15 01:05:04,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:04,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 01:05:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,352 INFO L225 Difference]: With dead ends: 80 [2019-10-15 01:05:04,352 INFO L226 Difference]: Without dead ends: 78 [2019-10-15 01:05:04,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-15 01:05:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-15 01:05:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-15 01:05:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-15 01:05:04,364 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-10-15 01:05:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,364 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-15 01:05:04,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-15 01:05:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:05:04,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,367 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, 1] [2019-10-15 01:05:04,367 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-10-15 01:05:04,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613882264] [2019-10-15 01:05:04,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,472 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-15 01:05:04,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613882264] [2019-10-15 01:05:04,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:04,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625406282] [2019-10-15 01:05:04,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:04,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:04,475 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-10-15 01:05:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,572 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-15 01:05:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 01:05:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,575 INFO L225 Difference]: With dead ends: 101 [2019-10-15 01:05:04,575 INFO L226 Difference]: Without dead ends: 99 [2019-10-15 01:05:04,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-15 01:05:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-10-15 01:05:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 01:05:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-15 01:05:04,589 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-10-15 01:05:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,592 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-15 01:05:04,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-15 01:05:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:05:04,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,594 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, 1, 1] [2019-10-15 01:05:04,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-10-15 01:05:04,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067257161] [2019-10-15 01:05:04,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,681 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-15 01:05:04,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067257161] [2019-10-15 01:05:04,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84726601] [2019-10-15 01:05:04,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,684 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-10-15 01:05:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,798 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-15 01:05:04,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-15 01:05:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,800 INFO L225 Difference]: With dead ends: 76 [2019-10-15 01:05:04,800 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 01:05:04,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 01:05:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-15 01:05:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 01:05:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-15 01:05:04,814 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-10-15 01:05:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,815 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-15 01:05:04,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-15 01:05:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:05:04,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,816 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, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,817 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-10-15 01:05:04,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110103152] [2019-10-15 01:05:04,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,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-15 01:05:04,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110103152] [2019-10-15 01:05:04,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17969274] [2019-10-15 01:05:04,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,898 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-10-15 01:05:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,089 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-10-15 01:05:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:05,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 01:05:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,092 INFO L225 Difference]: With dead ends: 141 [2019-10-15 01:05:05,092 INFO L226 Difference]: Without dead ends: 139 [2019-10-15 01:05:05,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-15 01:05:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-15 01:05:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 01:05:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-15 01:05:05,102 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-10-15 01:05:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,103 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-15 01:05:05,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-15 01:05:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:05:05,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,104 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, 1, 1, 1, 1, 1] [2019-10-15 01:05:05,105 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-10-15 01:05:05,105 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674992148] [2019-10-15 01:05:05,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,195 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-15 01:05:05,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674992148] [2019-10-15 01:05:05,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:05,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465818455] [2019-10-15 01:05:05,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:05,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:05,199 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-15 01:05:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,347 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-10-15 01:05:05,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:05,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 01:05:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,349 INFO L225 Difference]: With dead ends: 108 [2019-10-15 01:05:05,349 INFO L226 Difference]: Without dead ends: 106 [2019-10-15 01:05:05,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-15 01:05:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-10-15 01:05:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 01:05:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-10-15 01:05:05,369 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-10-15 01:05:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,371 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-10-15 01:05:05,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-10-15 01:05:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:05:05,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,373 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:05,373 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-10-15 01:05:05,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87603429] [2019-10-15 01:05:05,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,457 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-15 01:05:05,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87603429] [2019-10-15 01:05:05,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:05,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604664046] [2019-10-15 01:05:05,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:05,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:05,460 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-10-15 01:05:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,585 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-10-15 01:05:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:05,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-15 01:05:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,588 INFO L225 Difference]: With dead ends: 121 [2019-10-15 01:05:05,588 INFO L226 Difference]: Without dead ends: 119 [2019-10-15 01:05:05,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-15 01:05:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-10-15 01:05:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 01:05:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-15 01:05:05,601 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-10-15 01:05:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,602 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-15 01:05:05,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-15 01:05:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:05:05,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,607 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:05,608 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-10-15 01:05:05,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978518311] [2019-10-15 01:05:05,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,697 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-15 01:05:05,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978518311] [2019-10-15 01:05:05,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:05,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160566109] [2019-10-15 01:05:05,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:05,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:05,701 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-15 01:05:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,816 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-15 01:05:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:05,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-15 01:05:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,818 INFO L225 Difference]: With dead ends: 77 [2019-10-15 01:05:05,819 INFO L226 Difference]: Without dead ends: 75 [2019-10-15 01:05:05,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-15 01:05:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-15 01:05:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 01:05:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-15 01:05:05,826 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-10-15 01:05:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,827 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-15 01:05:05,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-15 01:05:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:05:05,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,829 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:05,830 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-10-15 01:05:05,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911130111] [2019-10-15 01:05:05,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,882 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-15 01:05:05,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911130111] [2019-10-15 01:05:05,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:05,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328594945] [2019-10-15 01:05:05,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:05,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:05,886 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-10-15 01:05:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,934 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-10-15 01:05:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:05,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:05:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,936 INFO L225 Difference]: With dead ends: 115 [2019-10-15 01:05:05,936 INFO L226 Difference]: Without dead ends: 75 [2019-10-15 01:05:05,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-15 01:05:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-15 01:05:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 01:05:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-15 01:05:05,951 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-10-15 01:05:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,951 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-15 01:05:05,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-15 01:05:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:05:05,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:05,953 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-10-15 01:05:05,954 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388062001] [2019-10-15 01:05:05,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:06,027 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-15 01:05:06,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388062001] [2019-10-15 01:05:06,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:06,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:06,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083122584] [2019-10-15 01:05:06,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:06,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:06,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:06,034 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-10-15 01:05:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:06,113 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-15 01:05:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:06,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 01:05:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:06,114 INFO L225 Difference]: With dead ends: 76 [2019-10-15 01:05:06,114 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 01:05:06,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 01:05:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-15 01:05:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 01:05:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-15 01:05:06,123 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-10-15 01:05:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:06,123 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-15 01:05:06,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-15 01:05:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:05:06,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:06,128 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:06,129 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-10-15 01:05:06,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:06,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104648120] [2019-10-15 01:05:06,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:06,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:06,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:06,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104648120] [2019-10-15 01:05:06,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176970065] [2019-10-15 01:05:06,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:06,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 01:05:06,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:06,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:06,381 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:06,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1933274277] [2019-10-15 01:05:06,441 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-15 01:05:06,477 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:06,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:06,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:06,723 INFO L272 AbstractInterpreter]: Visited 28 different actions 64 times. Merged at 6 different actions 36 times. Widened at 1 different actions 2 times. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2019-10-15 01:05:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:06,730 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:06,731 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:06,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-15 01:05:06,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976065880] [2019-10-15 01:05:06,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:05:06,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:05:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:05:06,733 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-10-15 01:05:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:06,896 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-10-15 01:05:06,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:06,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-15 01:05:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:06,897 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:05:06,898 INFO L226 Difference]: Without dead ends: 109 [2019-10-15 01:05:06,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:05:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-15 01:05:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-10-15 01:05:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 01:05:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-15 01:05:06,906 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-10-15 01:05:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-15 01:05:06,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:05:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-15 01:05:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:06,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:06,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:07,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:07,110 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-10-15 01:05:07,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:07,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66844492] [2019-10-15 01:05:07,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:07,158 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-15 01:05:07,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66844492] [2019-10-15 01:05:07,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:07,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:07,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961258919] [2019-10-15 01:05:07,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:07,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:07,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:07,161 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-10-15 01:05:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:07,263 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-15 01:05:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:07,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-15 01:05:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:07,264 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:05:07,264 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 01:05:07,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 01:05:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-15 01:05:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 01:05:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-15 01:05:07,270 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-10-15 01:05:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:07,270 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-15 01:05:07,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-15 01:05:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:07,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:07,271 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:07,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:07,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-10-15 01:05:07,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:07,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715328508] [2019-10-15 01:05:07,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:07,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715328508] [2019-10-15 01:05:07,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287253385] [2019-10-15 01:05:07,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 01:05:07,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:07,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:07,461 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:07,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1608630757] [2019-10-15 01:05:07,496 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-15 01:05:07,501 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:07,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:07,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:07,577 INFO L272 AbstractInterpreter]: Visited 30 different actions 75 times. Merged at 8 different actions 44 times. Widened at 2 different actions 3 times. Performed 320 root evaluator evaluations with a maximum evaluation depth of 4. Performed 320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2019-10-15 01:05:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:07,577 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:07,578 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:07,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-15 01:05:07,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828983234] [2019-10-15 01:05:07,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:05:07,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:05:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:05:07,579 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2019-10-15 01:05:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:07,672 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-15 01:05:07,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:07,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-15 01:05:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:07,674 INFO L225 Difference]: With dead ends: 69 [2019-10-15 01:05:07,674 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 01:05:07,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:05:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 01:05:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-10-15 01:05:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-15 01:05:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-15 01:05:07,679 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-10-15 01:05:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:07,679 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-15 01:05:07,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:05:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-15 01:05:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:05:07,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:07,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:07,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:07,892 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-10-15 01:05:07,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:07,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732899522] [2019-10-15 01:05:07,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:07,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:07,977 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-15 01:05:07,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732899522] [2019-10-15 01:05:07,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:07,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:07,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305709076] [2019-10-15 01:05:07,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:07,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:07,980 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-10-15 01:05:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,070 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-15 01:05:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:08,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-15 01:05:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,072 INFO L225 Difference]: With dead ends: 63 [2019-10-15 01:05:08,072 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 01:05:08,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 01:05:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-15 01:05:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-15 01:05:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-15 01:05:08,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-10-15 01:05:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,079 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-15 01:05:08,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-15 01:05:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:05:08,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,086 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-10-15 01:05:08,087 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287921085] [2019-10-15 01:05:08,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,153 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-15 01:05:08,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287921085] [2019-10-15 01:05:08,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:08,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398736633] [2019-10-15 01:05:08,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:08,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:08,155 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-10-15 01:05:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,245 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-10-15 01:05:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:08,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-10-15 01:05:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,246 INFO L225 Difference]: With dead ends: 71 [2019-10-15 01:05:08,246 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 01:05:08,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:05:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 01:05:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-15 01:05:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 01:05:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-15 01:05:08,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-10-15 01:05:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,252 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-15 01:05:08,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-15 01:05:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:05:08,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,268 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-10-15 01:05:08,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290661438] [2019-10-15 01:05:08,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,311 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-15 01:05:08,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290661438] [2019-10-15 01:05:08,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:08,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007379425] [2019-10-15 01:05:08,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:08,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,313 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-10-15 01:05:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,421 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-15 01:05:08,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:08,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:05:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,423 INFO L225 Difference]: With dead ends: 91 [2019-10-15 01:05:08,423 INFO L226 Difference]: Without dead ends: 89 [2019-10-15 01:05:08,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-15 01:05:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-15 01:05:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 01:05:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-15 01:05:08,429 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-10-15 01:05:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,429 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-15 01:05:08,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-15 01:05:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:05:08,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,431 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-10-15 01:05:08,431 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11259855] [2019-10-15 01:05:08,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,475 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-15 01:05:08,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11259855] [2019-10-15 01:05:08,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:08,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570346949] [2019-10-15 01:05:08,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:08,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,477 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-10-15 01:05:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,551 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-15 01:05:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:08,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-15 01:05:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,552 INFO L225 Difference]: With dead ends: 61 [2019-10-15 01:05:08,552 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 01:05:08,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 01:05:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-15 01:05:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-15 01:05:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-15 01:05:08,557 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-10-15 01:05:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,558 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-15 01:05:08,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-15 01:05:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:05:08,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,559 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-10-15 01:05:08,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469138190] [2019-10-15 01:05:08,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,598 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-15 01:05:08,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469138190] [2019-10-15 01:05:08,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:08,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738210870] [2019-10-15 01:05:08,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:08,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,600 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-10-15 01:05:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,620 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-15 01:05:08,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:08,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 01:05:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,621 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:05:08,621 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 01:05:08,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 01:05:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-15 01:05:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:05:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-15 01:05:08,627 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-10-15 01:05:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,627 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-15 01:05:08,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-15 01:05:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:05:08,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,629 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-10-15 01:05:08,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368498554] [2019-10-15 01:05:08,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,669 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-15 01:05:08,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368498554] [2019-10-15 01:05:08,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:08,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158273238] [2019-10-15 01:05:08,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:08,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,671 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-15 01:05:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,698 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-15 01:05:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:08,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-15 01:05:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,699 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:05:08,699 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:05:08,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:05:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-15 01:05:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 01:05:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-15 01:05:08,705 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-10-15 01:05:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,706 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-15 01:05:08,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-15 01:05:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:05:08,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,707 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-10-15 01:05:08,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563446088] [2019-10-15 01:05:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,757 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-15 01:05:08,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563446088] [2019-10-15 01:05:08,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:08,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:08,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757624992] [2019-10-15 01:05:08,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:08,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:08,759 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-15 01:05:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:08,889 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-10-15 01:05:08,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:08,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 01:05:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:08,890 INFO L225 Difference]: With dead ends: 90 [2019-10-15 01:05:08,890 INFO L226 Difference]: Without dead ends: 88 [2019-10-15 01:05:08,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-15 01:05:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-10-15 01:05:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 01:05:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-15 01:05:08,897 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-10-15 01:05:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:08,897 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-15 01:05:08,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-15 01:05:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:05:08,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:08,898 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:08,898 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-10-15 01:05:08,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:08,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218481200] [2019-10-15 01:05:08,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:08,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:08,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218481200] [2019-10-15 01:05:08,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802177459] [2019-10-15 01:05:08,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:05:09,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,134 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:09,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [244180810] [2019-10-15 01:05:09,180 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-10-15 01:05:09,182 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:09,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:09,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:09,263 INFO L272 AbstractInterpreter]: Visited 42 different actions 89 times. Merged at 8 different actions 47 times. Widened at 2 different actions 3 times. Performed 362 root evaluator evaluations with a maximum evaluation depth of 4. Performed 362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2019-10-15 01:05:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,264 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:09,264 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:09,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-15 01:05:09,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183821495] [2019-10-15 01:05:09,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:05:09,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:05:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:05:09,265 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2019-10-15 01:05:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:09,451 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-15 01:05:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:09,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-10-15 01:05:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:09,454 INFO L225 Difference]: With dead ends: 70 [2019-10-15 01:05:09,454 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 01:05:09,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:05:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 01:05:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-15 01:05:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-15 01:05:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-15 01:05:09,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-10-15 01:05:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,459 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-15 01:05:09,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:05:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-15 01:05:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:05:09,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:09,670 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-10-15 01:05:09,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18032170] [2019-10-15 01:05:09,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,721 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-15 01:05:09,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18032170] [2019-10-15 01:05:09,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:09,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752668422] [2019-10-15 01:05:09,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:09,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:09,723 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-15 01:05:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:09,839 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-15 01:05:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:09,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 01:05:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:09,841 INFO L225 Difference]: With dead ends: 71 [2019-10-15 01:05:09,841 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 01:05:09,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 01:05:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-15 01:05:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-15 01:05:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-15 01:05:09,846 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-10-15 01:05:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:09,847 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-15 01:05:09,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-15 01:05:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:05:09,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:09,848 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:09,848 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-10-15 01:05:09,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:09,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023249071] [2019-10-15 01:05:09,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:09,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:05:09,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023249071] [2019-10-15 01:05:09,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:09,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:09,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093996190] [2019-10-15 01:05:09,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:09,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:09,898 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-15 01:05:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:10,037 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-15 01:05:10,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:10,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:05:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:10,038 INFO L225 Difference]: With dead ends: 77 [2019-10-15 01:05:10,038 INFO L226 Difference]: Without dead ends: 75 [2019-10-15 01:05:10,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-15 01:05:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-10-15 01:05:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 01:05:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-15 01:05:10,043 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-10-15 01:05:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:10,044 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-15 01:05:10,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-15 01:05:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:05:10,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:10,044 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:10,045 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-10-15 01:05:10,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:10,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687345911] [2019-10-15 01:05:10,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:10,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:10,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687345911] [2019-10-15 01:05:10,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394923180] [2019-10-15 01:05:10,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:05:10,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:10,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:05:10,237 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:05:10,259 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:05:10,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-10-15 01:05:10,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884512725] [2019-10-15 01:05:10,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:10,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:10,261 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2019-10-15 01:05:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:10,300 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-15 01:05:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:10,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-15 01:05:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:10,301 INFO L225 Difference]: With dead ends: 60 [2019-10-15 01:05:10,301 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:10,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:10,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-15 01:05:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:10,304 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:10,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:10,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:10,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:10,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:10,631 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-10-15 01:05:11,469 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-10-15 01:05:11,797 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-10-15 01:05:12,214 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-10-15 01:05:12,354 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-10-15 01:05:12,358 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:12,359 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:12,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:12,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:12,359 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:12,359 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:12,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:12,359 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-10-15 01:05:12,360 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-10-15 01:05:12,360 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-15 01:05:12,360 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-10-15 01:05:12,360 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-15 01:05:12,360 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-15 01:05:12,361 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-10-15 01:05:12,362 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-15 01:05:12,363 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-10-15 01:05:12,363 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse3 (= 0 main_~main__c~0)) (.cse0 (<= 2 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse5 (= main_~__VERIFIER_assert__cond~10 1)) (.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (and (and (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)))) (not (= main_~__VERIFIER_assert__cond~7 0))) (not (= main_~__VERIFIER_assert__cond~8 0))))) (or (and .cse0 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse1 .cse2 (= main_~__VERIFIER_assert__cond~8 1) .cse3) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse1 .cse2 .cse4 .cse5 .cse3) (and .cse0 (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~15 0)) .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse2 (= main_~__VERIFIER_assert__cond~12 1)))) [2019-10-15 01:05:12,363 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-10-15 01:05:12,363 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-10-15 01:05:12,363 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-10-15 01:05:12,365 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-10-15 01:05:12,365 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-10-15 01:05:12,365 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-10-15 01:05:12,365 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-10-15 01:05:12,365 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2019-10-15 01:05:12,365 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-10-15 01:05:12,366 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-10-15 01:05:12,367 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-10-15 01:05:12,368 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-10-15 01:05:12,368 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (= main_~__VERIFIER_assert__cond~16 1)) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2019-10-15 01:05:12,369 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-10-15 01:05:12,369 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-15 01:05:12,369 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-10-15 01:05:12,369 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-10-15 01:05:12,369 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-10-15 01:05:12,370 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-15 01:05:12,370 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (and (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3 .cse4) (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 .cse4))))))) (or (and (= main_~__VERIFIER_assert__cond~0 1) .cse0) (and .cse0 (= main_~main__urilen~0 (+ main_~main__cp~0 1))))) [2019-10-15 01:05:12,370 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-15 01:05:12,370 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-10-15 01:05:12,370 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-10-15 01:05:12,370 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse3 (= main_~__VERIFIER_assert__cond~10 1)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (and (<= 2 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (< 0 main_~main__scheme~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0))))))) (or (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse0 (and .cse1 (= 0 main_~main__c~0) .cse2) .cse3) (and (not (= main_~__VERIFIER_assert__cond~15 0)) (= main_~__VERIFIER_assert__cond~12 1) .cse3 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__c~0) .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0)))))) [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= main_~__VERIFIER_assert__cond~0 0)) [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-10-15 01:05:12,371 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-15 01:05:12,372 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-10-15 01:05:12,373 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-10-15 01:05:12,374 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-15 01:05:12,374 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-10-15 01:05:12,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:12 BoogieIcfgContainer [2019-10-15 01:05:12,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:12,423 INFO L168 Benchmark]: Toolchain (without parser) took 9813.69 ms. Allocated memory was 139.5 MB in the beginning and 289.9 MB in the end (delta: 150.5 MB). Free memory was 103.0 MB in the beginning and 171.1 MB in the end (delta: -68.1 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:12,427 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:05:12,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.35 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 90.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:12,431 INFO L168 Benchmark]: Boogie Preprocessor took 133.87 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 90.0 MB in the beginning and 182.2 MB in the end (delta: -92.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:12,431 INFO L168 Benchmark]: RCFGBuilder took 533.32 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 155.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:12,432 INFO L168 Benchmark]: TraceAbstraction took 8767.59 ms. Allocated memory was 204.5 MB in the beginning and 289.9 MB in the end (delta: 85.5 MB). Free memory was 155.0 MB in the beginning and 171.1 MB in the end (delta: -16.2 MB). Peak memory consumption was 141.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:12,437 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.22 ms. Allocated memory is still 139.5 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.35 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 90.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.87 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 90.0 MB in the beginning and 182.2 MB in the end (delta: -92.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 533.32 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 155.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8767.59 ms. Allocated memory was 204.5 MB in the beginning and 289.9 MB in the end (delta: 85.5 MB). Free memory was 155.0 MB in the beginning and 171.1 MB in the end (delta: -16.2 MB). Peak memory consumption was 141.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((2 <= main__cp && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) || ((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c)) || (((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__urilen == main__cp + 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && 0 == main__c) && ((((((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && ((((((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 1400 SDtfs, 2441 SDslu, 1862 SDs, 0 SdLazy, 1176 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 337 SyntacticMatches, 27 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 549 HoareAnnotationTreeSize, 9 FomulaSimplifications, 28106 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 22934 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1081 ConstructedInterpolants, 0 QuantifiedInterpolants, 95518 SizeOfPredicates, 33 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 24/47 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...