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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:00,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:00,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:00,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:00,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:00,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:00,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:00,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:00,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:00,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:00,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:00,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:00,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:00,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:00,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:00,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:00,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:00,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:00,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:00,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:00,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:00,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:00,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:00,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:00,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:00,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:00,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:00,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:00,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:00,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:00,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:00,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:00,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:00,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:00,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:00,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:00,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:00,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:00,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:00,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:00,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:00,464 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:00,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:00,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:00,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:00,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:00,492 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:00,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:00,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:00,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:00,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:00,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:00,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:00,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:00,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:00,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:00,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:00,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:00,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:00,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:00,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:00,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:00,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:00,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:00,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:00,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:00,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:00,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:00,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:00,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:00,499 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:00,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:00,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:00,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:00,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:00,828 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:00,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-15 01:05:00,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181615ead/0cacbd9b629a4046907e44a449136d6a/FLAGec6e99ea7 [2019-10-15 01:05:01,354 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:01,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-15 01:05:01,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181615ead/0cacbd9b629a4046907e44a449136d6a/FLAGec6e99ea7 [2019-10-15 01:05:01,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181615ead/0cacbd9b629a4046907e44a449136d6a [2019-10-15 01:05:01,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:01,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:01,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:01,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:01,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:01,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:01" (1/1) ... [2019-10-15 01:05:01,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12830561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:01, skipping insertion in model container [2019-10-15 01:05:01,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:01" (1/1) ... [2019-10-15 01:05:01,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:01,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:01,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:01,984 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:02,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:02,124 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:02,125 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,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:02,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:02,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:02,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:02,142 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:02,142 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:02,151 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:02,152 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:02,158 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:02,162 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:02,164 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:02,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:02,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:02,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:02,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:02,168 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:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:02,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:02,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:02,594 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:05:02,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:02 BoogieIcfgContainer [2019-10-15 01:05:02,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:02,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:02,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:02,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:02,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:01" (1/3) ... [2019-10-15 01:05:02,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee603e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:02, skipping insertion in model container [2019-10-15 01:05:02,606 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:02,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee603e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:02, skipping insertion in model container [2019-10-15 01:05:02,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:02" (3/3) ... [2019-10-15 01:05:02,610 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-15 01:05:02,621 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:02,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-15 01:05:02,640 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-15 01:05:02,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:02,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:02,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:02,666 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:02,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:02,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:02,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:02,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-15 01:05:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:05:02,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:02,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:02,696 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-10-15 01:05:02,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:02,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327951408] [2019-10-15 01:05:02,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:02,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:02,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:02,866 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:02,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327951408] [2019-10-15 01:05:02,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:02,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:02,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588917162] [2019-10-15 01:05:02,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:02,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:02,893 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-10-15 01:05:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:02,942 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2019-10-15 01:05:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:02,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 01:05:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:02,958 INFO L225 Difference]: With dead ends: 88 [2019-10-15 01:05:02,958 INFO L226 Difference]: Without dead ends: 76 [2019-10-15 01:05:02,963 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:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-15 01:05:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-10-15 01:05:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-15 01:05:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-15 01:05:03,028 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-10-15 01:05:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,029 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-15 01:05:03,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-15 01:05:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:03,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,033 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-10-15 01:05:03,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261628259] [2019-10-15 01:05:03,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,136 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,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261628259] [2019-10-15 01:05:03,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:03,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49562608] [2019-10-15 01:05:03,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:03,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:03,146 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-15 01:05:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,297 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-10-15 01:05:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:03,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 01:05:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,301 INFO L225 Difference]: With dead ends: 153 [2019-10-15 01:05:03,301 INFO L226 Difference]: Without dead ends: 101 [2019-10-15 01:05:03,303 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:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-15 01:05:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-10-15 01:05:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 01:05:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-15 01:05:03,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-10-15 01:05:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,321 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-15 01:05:03,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-15 01:05:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:05:03,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-10-15 01:05:03,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521242661] [2019-10-15 01:05:03,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,378 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,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521242661] [2019-10-15 01:05:03,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:03,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900753137] [2019-10-15 01:05:03,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:03,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:03,381 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-10-15 01:05:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,507 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-10-15 01:05:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:03,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 01:05:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,510 INFO L225 Difference]: With dead ends: 75 [2019-10-15 01:05:03,510 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:05:03,511 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:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:05:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-10-15 01:05:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-15 01:05:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-15 01:05:03,527 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-10-15 01:05:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,528 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-15 01:05:03,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-15 01:05:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:05:03,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,532 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-10-15 01:05:03,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722563924] [2019-10-15 01:05:03,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,611 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,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722563924] [2019-10-15 01:05:03,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:03,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731360530] [2019-10-15 01:05:03,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:03,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:03,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:03,614 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-10-15 01:05:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,699 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-10-15 01:05:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:03,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 01:05:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,702 INFO L225 Difference]: With dead ends: 96 [2019-10-15 01:05:03,702 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 01:05:03,703 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:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 01:05:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-10-15 01:05:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:05:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:05:03,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-10-15 01:05:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,711 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:05:03,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:05:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:05:03,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,713 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-10-15 01:05:03,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067751715] [2019-10-15 01:05:03,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,769 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,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067751715] [2019-10-15 01:05:03,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:03,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994787700] [2019-10-15 01:05:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:03,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:03,782 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-10-15 01:05:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,896 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-10-15 01:05:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:03,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-15 01:05:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,897 INFO L225 Difference]: With dead ends: 95 [2019-10-15 01:05:03,898 INFO L226 Difference]: Without dead ends: 93 [2019-10-15 01:05:03,901 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:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-15 01:05:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-10-15 01:05:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-15 01:05:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-15 01:05:03,912 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-10-15 01:05:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-15 01:05:03,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-15 01:05:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:05:03,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,917 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,918 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-10-15 01:05:03,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935212527] [2019-10-15 01:05:03,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,992 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,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935212527] [2019-10-15 01:05:03,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:03,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248151879] [2019-10-15 01:05:03,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:03,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:03,995 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-10-15 01:05:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,070 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-15 01:05:04,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 01:05:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,071 INFO L225 Difference]: With dead ends: 69 [2019-10-15 01:05:04,071 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 01:05:04,072 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,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 01:05:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-10-15 01:05:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:05:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:05:04,078 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-15 01:05:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,078 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:05:04,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:05:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:05:04,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,080 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-10-15 01:05:04,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410255109] [2019-10-15 01:05:04,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,129 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,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410255109] [2019-10-15 01:05:04,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:04,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924050607] [2019-10-15 01:05:04,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:04,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:04,132 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-10-15 01:05:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,210 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-10-15 01:05:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:04,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 01:05:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,211 INFO L225 Difference]: With dead ends: 91 [2019-10-15 01:05:04,211 INFO L226 Difference]: Without dead ends: 89 [2019-10-15 01:05:04,212 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,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-15 01:05:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-10-15 01:05:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-15 01:05:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-15 01:05:04,218 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-10-15 01:05:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,218 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-15 01:05:04,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-15 01:05:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:05:04,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,220 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-10-15 01:05:04,221 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141526151] [2019-10-15 01:05:04,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,279 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,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141526151] [2019-10-15 01:05:04,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827704009] [2019-10-15 01:05:04,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,283 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-10-15 01:05:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,400 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-15 01:05:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 01:05:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,402 INFO L225 Difference]: With dead ends: 73 [2019-10-15 01:05:04,402 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 01:05:04,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 01:05:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-10-15 01:05:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:05:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-15 01:05:04,409 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-10-15 01:05:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,409 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-15 01:05:04,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-15 01:05:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:05:04,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,410 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-10-15 01:05:04,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841016781] [2019-10-15 01:05:04,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,454 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,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841016781] [2019-10-15 01:05:04,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972834533] [2019-10-15 01:05:04,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,456 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-10-15 01:05:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,543 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-15 01:05:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:04,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 01:05:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,545 INFO L225 Difference]: With dead ends: 61 [2019-10-15 01:05:04,545 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 01:05:04,545 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,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 01:05:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-10-15 01:05:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 01:05:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-15 01:05:04,551 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-10-15 01:05:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,551 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-15 01:05:04,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-15 01:05:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:04,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,552 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:04,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-10-15 01:05:04,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181316747] [2019-10-15 01:05:04,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,597 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,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181316747] [2019-10-15 01:05:04,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:04,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68517430] [2019-10-15 01:05:04,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:04,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:04,599 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-10-15 01:05:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,654 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-15 01:05:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:04,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 01:05:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,655 INFO L225 Difference]: With dead ends: 61 [2019-10-15 01:05:04,655 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 01:05:04,656 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,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 01:05:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-10-15 01:05:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:05:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-15 01:05:04,661 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-10-15 01:05:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,662 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-15 01:05:04,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-15 01:05:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:05:04,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,663 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,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-10-15 01:05:04,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449208678] [2019-10-15 01:05:04,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,715 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,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449208678] [2019-10-15 01:05:04,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:04,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364815935] [2019-10-15 01:05:04,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:04,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:04,718 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-10-15 01:05:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,790 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-15 01:05:04,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 01:05:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,792 INFO L225 Difference]: With dead ends: 69 [2019-10-15 01:05:04,792 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 01:05:04,792 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,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 01:05:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-10-15 01:05:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 01:05:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-15 01:05:04,802 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-10-15 01:05:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,804 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-15 01:05:04,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-15 01:05:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:05:04,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,808 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-10-15 01:05:04,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468205642] [2019-10-15 01:05:04,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,870 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,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468205642] [2019-10-15 01:05:04,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508671858] [2019-10-15 01:05:04,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,872 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-15 01:05:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,984 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-10-15 01:05:04,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:05:04,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-15 01:05:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,986 INFO L225 Difference]: With dead ends: 74 [2019-10-15 01:05:04,986 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:05:04,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:05:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-10-15 01:05:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-15 01:05:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-15 01:05:04,991 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-10-15 01:05:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,991 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-15 01:05:04,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-15 01:05:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:05:04,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,993 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,993 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-10-15 01:05:04,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457742051] [2019-10-15 01:05:04,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,054 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,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457742051] [2019-10-15 01:05:05,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:05,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316208948] [2019-10-15 01:05:05,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:05,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:05,057 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-10-15 01:05:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,186 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-10-15 01:05:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:05,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-15 01:05:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,187 INFO L225 Difference]: With dead ends: 62 [2019-10-15 01:05:05,188 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 01:05:05,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:05:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 01:05:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-10-15 01:05:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:05:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:05:05,192 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-10-15 01:05:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,193 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:05:05,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:05:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:05:05,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,194 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:05,194 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-10-15 01:05:05,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729521392] [2019-10-15 01:05:05,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,254 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,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729521392] [2019-10-15 01:05:05,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:05,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184395319] [2019-10-15 01:05:05,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:05,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:05,256 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-10-15 01:05:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,365 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-10-15 01:05:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:05,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-15 01:05:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,366 INFO L225 Difference]: With dead ends: 87 [2019-10-15 01:05:05,366 INFO L226 Difference]: Without dead ends: 85 [2019-10-15 01:05:05,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-15 01:05:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-10-15 01:05:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 01:05:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-15 01:05:05,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-10-15 01:05:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,378 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-15 01:05:05,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-15 01:05:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:05:05,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,381 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] [2019-10-15 01:05:05,382 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-10-15 01:05:05,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489344305] [2019-10-15 01:05:05,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,451 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,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489344305] [2019-10-15 01:05:05,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:05,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396842053] [2019-10-15 01:05:05,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:05,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:05,455 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-10-15 01:05:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,579 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-15 01:05:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:05,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-15 01:05:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,581 INFO L225 Difference]: With dead ends: 60 [2019-10-15 01:05:05,581 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 01:05:05,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:05:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 01:05:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-10-15 01:05:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 01:05:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-15 01:05:05,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-10-15 01:05:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,588 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-15 01:05:05,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-15 01:05:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:05:05,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:05,592 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] [2019-10-15 01:05:05,594 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-10-15 01:05:05,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:05,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533742542] [2019-10-15 01:05:05,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:05,650 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,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533742542] [2019-10-15 01:05:05,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:05,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:05,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981155399] [2019-10-15 01:05:05,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:05,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:05,656 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-10-15 01:05:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,820 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-10-15 01:05:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:05,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-15 01:05:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,821 INFO L225 Difference]: With dead ends: 125 [2019-10-15 01:05:05,821 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:05,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:05:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:05,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-15 01:05:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,824 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:05,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:05,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:05,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:06,043 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-10-15 01:05:06,224 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-10-15 01:05:06,336 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-10-15 01:05:06,741 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 9 [2019-10-15 01:05:06,954 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-10-15 01:05:07,139 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 18 [2019-10-15 01:05:07,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:07,143 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:07,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:07,143 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:07,143 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:07,144 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:07,144 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:07,144 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-10-15 01:05:07,144 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-15 01:05:07,144 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-10-15 01:05:07,144 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-10-15 01:05:07,145 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-10-15 01:05:07,145 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-10-15 01:05:07,145 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-10-15 01:05:07,145 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-10-15 01:05:07,145 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= main_~__VERIFIER_assert__cond~12 0))) (and .cse3 .cse2))))) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1) (and (and (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0)) .cse1) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-15 01:05:07,146 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-15 01:05:07,147 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-10-15 01:05:07,148 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-10-15 01:05:07,149 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-10-15 01:05:07,149 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-10-15 01:05:07,149 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-10-15 01:05:07,149 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-10-15 01:05:07,149 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-15 01:05:07,150 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-10-15 01:05:07,151 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2019-10-15 01:05:07,151 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-10-15 01:05:07,151 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-10-15 01:05:07,151 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-10-15 01:05:07,152 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-10-15 01:05:07,153 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-15 01:05:07,154 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2019-10-15 01:05:07,154 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-15 01:05:07,154 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-10-15 01:05:07,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:07 BoogieIcfgContainer [2019-10-15 01:05:07,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:07,193 INFO L168 Benchmark]: Toolchain (without parser) took 5461.23 ms. Allocated memory was 138.4 MB in the beginning and 277.9 MB in the end (delta: 139.5 MB). Free memory was 103.4 MB in the beginning and 166.6 MB in the end (delta: -63.1 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,194 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.03 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 103.2 MB in the beginning and 179.5 MB in the end (delta: -76.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,201 INFO L168 Benchmark]: Boogie Preprocessor took 40.95 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 177.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,203 INFO L168 Benchmark]: RCFGBuilder took 429.38 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 156.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,208 INFO L168 Benchmark]: TraceAbstraction took 4592.92 ms. Allocated memory was 200.8 MB in the beginning and 277.9 MB in the end (delta: 77.1 MB). Free memory was 156.2 MB in the beginning and 166.6 MB in the end (delta: -10.4 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:07,214 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.03 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 103.2 MB in the beginning and 179.5 MB in the end (delta: -76.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.95 ms. Allocated memory is still 200.8 MB. Free memory was 179.5 MB in the beginning and 177.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 429.38 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 156.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4592.92 ms. Allocated memory was 200.8 MB in the beginning and 277.9 MB in the end (delta: 77.1 MB). Free memory was 156.2 MB in the beginning and 166.6 MB in the end (delta: -10.4 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: 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: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && 1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) || (((main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j)) || (((1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 936 SDtfs, 1254 SDslu, 796 SDs, 0 SdLazy, 795 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 84259529 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 304610 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...