/usr/bin/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-fb55353 [2019-11-07 00:33:58,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:33:58,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:33:58,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:33:58,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:33:58,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:33:58,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:33:58,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:33:58,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:33:58,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:33:58,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:33:58,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:33:58,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:33:58,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:33:58,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:33:58,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:33:58,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:33:58,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:33:58,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:33:58,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:33:58,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:33:58,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:33:58,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:33:58,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:33:58,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:33:58,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:33:58,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:33:58,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:33:58,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:33:58,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:33:58,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:33:58,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:33:58,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:33:58,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:33:58,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:33:58,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:33:58,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:33:58,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:33:58,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:33:58,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:33:58,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:33:58,571 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-11-07 00:33:58,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:33:58,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:33:58,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:33:58,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:33:58,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:33:58,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:33:58,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:33:58,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:33:58,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:33:58,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:33:58,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:33:58,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:33:58,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:33:58,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:33:58,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:33:58,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:33:58,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:33:58,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:33:58,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:33:58,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:33:58,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:33:58,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:33:58,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:33:58,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:33:58,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:33:58,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:33:58,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:33:58,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:33:58,593 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-11-07 00:33:58,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:33:58,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:33:58,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:33:58,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:33:58,887 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:33:58,888 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-11-07 00:33:58,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9621c84a/f781439f57f3411795cdbe565b6beb3d/FLAG7a7e073b9 [2019-11-07 00:33:59,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:33:59,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-07 00:33:59,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9621c84a/f781439f57f3411795cdbe565b6beb3d/FLAG7a7e073b9 [2019-11-07 00:33:59,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9621c84a/f781439f57f3411795cdbe565b6beb3d [2019-11-07 00:33:59,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:33:59,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:33:59,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:33:59,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:33:59,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:33:59,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:59" (1/1) ... [2019-11-07 00:33:59,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7eb3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:59, skipping insertion in model container [2019-11-07 00:33:59,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:59" (1/1) ... [2019-11-07 00:33:59,906 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:33:59,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:00,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:00,277 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:00,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:00,403 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:00,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00 WrapperNode [2019-11-07 00:34:00,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:00,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:00,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:00,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:00,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... [2019-11-07 00:34:00,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:00,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:00,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:00,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:00,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:00,863 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:00,864 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:34:00,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:00 BoogieIcfgContainer [2019-11-07 00:34:00,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:00,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:00,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:00,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:00,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:33:59" (1/3) ... [2019-11-07 00:34:00,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c762ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:00, skipping insertion in model container [2019-11-07 00:34:00,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:00" (2/3) ... [2019-11-07 00:34:00,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c762ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:00, skipping insertion in model container [2019-11-07 00:34:00,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:00" (3/3) ... [2019-11-07 00:34:00,873 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-07 00:34:00,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:00,887 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-07 00:34:00,897 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-07 00:34:00,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:00,922 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:00,922 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:00,922 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:00,922 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:00,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:00,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:00,923 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-07 00:34:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:34:00,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:00,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:00,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:00,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-11-07 00:34:00,967 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:00,967 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136182865] [2019-11-07 00:34:00,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:01,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136182865] [2019-11-07 00:34:01,123 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:01,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:01,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331187982] [2019-11-07 00:34:01,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:01,130 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:01,144 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-11-07 00:34:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:01,191 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2019-11-07 00:34:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:01,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 00:34:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:01,204 INFO L225 Difference]: With dead ends: 88 [2019-11-07 00:34:01,204 INFO L226 Difference]: Without dead ends: 76 [2019-11-07 00:34:01,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-07 00:34:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-11-07 00:34:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 00:34:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-07 00:34:01,254 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-11-07 00:34:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:01,254 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-07 00:34:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-07 00:34:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:34:01,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:01,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:01,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-11-07 00:34:01,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:01,258 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221276430] [2019-11-07 00:34:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:01,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221276430] [2019-11-07 00:34:01,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:01,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:01,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303908735] [2019-11-07 00:34:01,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:01,341 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:01,342 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-11-07 00:34:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:01,502 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-11-07 00:34:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:01,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 00:34:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:01,505 INFO L225 Difference]: With dead ends: 153 [2019-11-07 00:34:01,505 INFO L226 Difference]: Without dead ends: 101 [2019-11-07 00:34:01,507 INFO L630 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-11-07 00:34:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-07 00:34:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-11-07 00:34:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 00:34:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-07 00:34:01,523 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-11-07 00:34:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:01,525 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-07 00:34:01,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-07 00:34:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 00:34:01,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:01,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:01,527 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-11-07 00:34:01,528 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:01,528 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705205154] [2019-11-07 00:34:01,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:01,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-11-07 00:34:01,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705205154] [2019-11-07 00:34:01,612 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:01,612 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:01,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114804730] [2019-11-07 00:34:01,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:01,613 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:01,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:01,614 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-11-07 00:34:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:01,704 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-07 00:34:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:01,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 00:34:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:01,707 INFO L225 Difference]: With dead ends: 75 [2019-11-07 00:34:01,707 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 00:34:01,707 INFO L630 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-11-07 00:34:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 00:34:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-11-07 00:34:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-07 00:34:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-07 00:34:01,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-11-07 00:34:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:01,716 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-07 00:34:01,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-07 00:34:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:01,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:01,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:01,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-11-07 00:34:01,719 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:01,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774009239] [2019-11-07 00:34:01,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:01,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774009239] [2019-11-07 00:34:01,761 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:01,762 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:01,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865623597] [2019-11-07 00:34:01,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:01,763 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:01,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:01,764 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-11-07 00:34:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:01,862 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-07 00:34:01,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:01,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 00:34:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:01,864 INFO L225 Difference]: With dead ends: 96 [2019-11-07 00:34:01,864 INFO L226 Difference]: Without dead ends: 94 [2019-11-07 00:34:01,865 INFO L630 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-11-07 00:34:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-07 00:34:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-11-07 00:34:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-07 00:34:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-07 00:34:01,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-11-07 00:34:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:01,874 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-07 00:34:01,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-07 00:34:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:01,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:01,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:01,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:01,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-11-07 00:34:01,877 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:01,877 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968509793] [2019-11-07 00:34:01,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:01,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968509793] [2019-11-07 00:34:01,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:01,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:01,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886908291] [2019-11-07 00:34:01,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:01,970 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:01,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:01,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:01,970 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-11-07 00:34:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,089 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-07 00:34:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:02,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 00:34:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,091 INFO L225 Difference]: With dead ends: 95 [2019-11-07 00:34:02,092 INFO L226 Difference]: Without dead ends: 93 [2019-11-07 00:34:02,092 INFO L630 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-11-07 00:34:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-07 00:34:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-11-07 00:34:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-07 00:34:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-07 00:34:02,100 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-11-07 00:34:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,100 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-07 00:34:02,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-07 00:34:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:02,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,102 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-11-07 00:34:02,103 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,103 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852039155] [2019-11-07 00:34:02,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852039155] [2019-11-07 00:34:02,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:02,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:02,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204451266] [2019-11-07 00:34:02,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:02,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:02,179 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-11-07 00:34:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,254 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-07 00:34:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:02,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 00:34:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,256 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:02,256 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:02,257 INFO L630 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-11-07 00:34:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-11-07 00:34:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-07 00:34:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-07 00:34:02,263 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-07 00:34:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,264 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-07 00:34:02,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-07 00:34:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:02,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,266 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-11-07 00:34:02,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427994485] [2019-11-07 00:34:02,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427994485] [2019-11-07 00:34:02,308 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:02,309 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:02,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353299925] [2019-11-07 00:34:02,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:02,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:02,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:02,310 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-11-07 00:34:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,402 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-11-07 00:34:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:02,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-07 00:34:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,404 INFO L225 Difference]: With dead ends: 91 [2019-11-07 00:34:02,404 INFO L226 Difference]: Without dead ends: 89 [2019-11-07 00:34:02,405 INFO L630 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-11-07 00:34:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-07 00:34:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-11-07 00:34:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-07 00:34:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-07 00:34:02,418 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-11-07 00:34:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,418 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-07 00:34:02,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-07 00:34:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:02,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-11-07 00:34:02,422 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612757681] [2019-11-07 00:34:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,496 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612757681] [2019-11-07 00:34:02,496 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:02,497 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:02,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489132491] [2019-11-07 00:34:02,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:02,498 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:02,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:02,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:02,498 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-07 00:34:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,636 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-07 00:34:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:02,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,638 INFO L225 Difference]: With dead ends: 73 [2019-11-07 00:34:02,638 INFO L226 Difference]: Without dead ends: 71 [2019-11-07 00:34:02,639 INFO L630 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-11-07 00:34:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-07 00:34:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-11-07 00:34:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 00:34:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-07 00:34:02,645 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-11-07 00:34:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,645 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-07 00:34:02,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-07 00:34:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:02,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,647 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-11-07 00:34:02,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242339645] [2019-11-07 00:34:02,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,699 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242339645] [2019-11-07 00:34:02,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:02,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:02,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660292593] [2019-11-07 00:34:02,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:02,704 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:02,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:02,705 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-07 00:34:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,780 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-07 00:34:02,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:02,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,781 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:02,782 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 00:34:02,782 INFO L630 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-11-07 00:34:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 00:34:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-11-07 00:34:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-07 00:34:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-07 00:34:02,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-11-07 00:34:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,793 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-07 00:34:02,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-07 00:34:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:34:02,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,795 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-11-07 00:34:02,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633263692] [2019-11-07 00:34:02,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,856 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633263692] [2019-11-07 00:34:02,856 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:02,856 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:02,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243130721] [2019-11-07 00:34:02,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:02,859 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:02,860 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-11-07 00:34:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:02,919 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-07 00:34:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:02,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-07 00:34:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:02,921 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:02,921 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 00:34:02,926 INFO L630 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-11-07 00:34:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 00:34:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-11-07 00:34:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 00:34:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-07 00:34:02,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-07 00:34:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:02,936 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-07 00:34:02,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-07 00:34:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:02,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:02,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:02,940 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-11-07 00:34:02,941 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:02,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460485307] [2019-11-07 00:34:02,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:02,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460485307] [2019-11-07 00:34:02,999 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,000 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:03,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536530275] [2019-11-07 00:34:03,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:03,001 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:03,001 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-11-07 00:34:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:03,077 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-07 00:34:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:03,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 00:34:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:03,078 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:03,078 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:03,079 INFO L630 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-11-07 00:34:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-11-07 00:34:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 00:34:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-07 00:34:03,085 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-11-07 00:34:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:03,085 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-07 00:34:03,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-07 00:34:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:34:03,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:03,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:03,087 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-11-07 00:34:03,088 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:03,088 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749557301] [2019-11-07 00:34:03,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34: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-11-07 00:34:03,137 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749557301] [2019-11-07 00:34:03,137 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,137 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747041941] [2019-11-07 00:34:03,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:03,138 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:03,139 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-11-07 00:34:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:03,246 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-07 00:34:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:03,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-07 00:34:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:03,248 INFO L225 Difference]: With dead ends: 74 [2019-11-07 00:34:03,248 INFO L226 Difference]: Without dead ends: 72 [2019-11-07 00:34:03,249 INFO L630 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-11-07 00:34:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-07 00:34:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-11-07 00:34:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-07 00:34:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-07 00:34:03,254 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-11-07 00:34:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:03,255 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-07 00:34:03,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-07 00:34:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:34:03,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:03,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:03,256 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-11-07 00:34:03,257 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:03,257 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852909977] [2019-11-07 00:34:03,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:03,309 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852909977] [2019-11-07 00:34:03,309 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,309 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:03,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707285239] [2019-11-07 00:34:03,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:03,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:03,311 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-11-07 00:34:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:03,442 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-07 00:34:03,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:03,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-07 00:34:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:03,443 INFO L225 Difference]: With dead ends: 62 [2019-11-07 00:34:03,443 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 00:34:03,444 INFO L630 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-11-07 00:34:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 00:34:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-11-07 00:34:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-07 00:34:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-07 00:34:03,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-11-07 00:34:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:03,448 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-07 00:34:03,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-07 00:34:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:34:03,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:03,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:03,450 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:03,450 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-11-07 00:34:03,450 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:03,451 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681643595] [2019-11-07 00:34:03,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:03,503 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681643595] [2019-11-07 00:34:03,504 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,504 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:03,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40959503] [2019-11-07 00:34:03,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:03,505 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:03,505 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-11-07 00:34:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:03,614 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-11-07 00:34:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:03,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-07 00:34:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:03,616 INFO L225 Difference]: With dead ends: 87 [2019-11-07 00:34:03,616 INFO L226 Difference]: Without dead ends: 85 [2019-11-07 00:34:03,617 INFO L630 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-11-07 00:34:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-07 00:34:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-11-07 00:34:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:34:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-07 00:34:03,627 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-11-07 00:34:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:03,627 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-07 00:34:03,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-07 00:34:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:34:03,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:03,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:03,632 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-11-07 00:34:03,632 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:03,633 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410508163] [2019-11-07 00:34:03,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:03,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410508163] [2019-11-07 00:34:03,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:03,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075488720] [2019-11-07 00:34:03,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:03,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:03,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:03,708 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-11-07 00:34:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:03,840 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-07 00:34:03,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:03,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-07 00:34:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:03,841 INFO L225 Difference]: With dead ends: 60 [2019-11-07 00:34:03,841 INFO L226 Difference]: Without dead ends: 58 [2019-11-07 00:34:03,842 INFO L630 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-11-07 00:34:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-07 00:34:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-11-07 00:34:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-07 00:34:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-07 00:34:03,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-11-07 00:34:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:03,848 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-07 00:34:03,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-07 00:34:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:34:03,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:03,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:03,849 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-11-07 00:34:03,850 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:03,850 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104270335] [2019-11-07 00:34:03,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:03,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104270335] [2019-11-07 00:34:03,888 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:03,888 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:03,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405740530] [2019-11-07 00:34:03,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:03,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:03,890 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-11-07 00:34:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:04,066 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-11-07 00:34:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:04,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-07 00:34:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:04,067 INFO L225 Difference]: With dead ends: 125 [2019-11-07 00:34:04,067 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:04,068 INFO L630 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-11-07 00:34:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:04,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-07 00:34:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:04,070 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:04,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:04,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:04,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:04,260 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-11-07 00:34:04,393 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-11-07 00:34:04,512 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-11-07 00:34:04,984 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 9 [2019-11-07 00:34:05,199 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-11-07 00:34:05,341 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 18 [2019-11-07 00:34:05,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:05,344 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-11-07 00:34:05,344 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-11-07 00:34:05,345 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-11-07 00:34:05,345 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-11-07 00:34:05,345 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-11-07 00:34:05,345 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-11-07 00:34:05,345 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-07 00:34:05,346 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-07 00:34:05,347 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-11-07 00:34:05,348 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-11-07 00:34:05,349 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-07 00:34:05,349 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-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-07 00:34:05,350 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-11-07 00:34:05,351 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-07 00:34:05,352 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-11-07 00:34:05,352 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-07 00:34:05,352 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-07 00:34:05,352 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-11-07 00:34:05,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:05 BoogieIcfgContainer [2019-11-07 00:34:05,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:05,376 INFO L168 Benchmark]: Toolchain (without parser) took 5529.74 ms. Allocated memory was 138.9 MB in the beginning and 281.5 MB in the end (delta: 142.6 MB). Free memory was 103.5 MB in the beginning and 168.8 MB in the end (delta: -65.3 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,376 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.19 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 181.2 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,378 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 179.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,379 INFO L168 Benchmark]: RCFGBuilder took 423.36 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 157.4 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,380 INFO L168 Benchmark]: TraceAbstraction took 4507.80 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 157.4 MB in the beginning and 168.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:05,383 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.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 540.19 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 181.2 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 179.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 423.36 ms. Allocated memory is still 202.4 MB. Free memory was 179.2 MB in the beginning and 157.4 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4507.80 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 157.4 MB in the beginning and 168.8 MB in the end (delta: -11.3 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 188]: 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: 71]: 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: 54]: 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: 42]: 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: 224]: 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: 160]: 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: 107]: 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: 148]: 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.2s, HoareTripleCheckerStatistics: 936 SDtfs, 1254 SDslu, 796 SDs, 0 SdLazy, 795 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 304610 FormulaSimplificationTreeSizeReductionInter, 0.8s 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...