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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:39:59,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:39:59,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:39:59,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:39:59,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:39:59,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:39:59,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:39:59,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:39:59,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:39:59,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:39:59,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:39:59,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:39:59,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:39:59,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:39:59,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:39:59,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:39:59,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:39:59,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:39:59,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:39:59,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:39:59,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:39:59,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:39:59,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:39:59,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:39:59,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:39:59,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:39:59,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:39:59,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:39:59,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:39:59,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:39:59,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:39:59,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:39:59,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:39:59,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:39:59,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:39:59,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:39:59,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:39:59,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:39:59,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:39:59,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:39:59,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:39:59,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:39:59,241 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:39:59,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:39:59,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:39:59,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:39:59,243 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:39:59,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:39:59,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:39:59,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:39:59,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:39:59,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:39:59,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:39:59,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:39:59,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:39:59,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:39:59,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:39:59,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:39:59,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:39:59,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:39:59,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:39:59,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:39:59,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:39:59,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:39:59,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:39:59,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:39:59,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:39:59,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:39:59,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:39:59,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:39:59,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:39:59,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:39:59,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:39:59,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:39:59,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:39:59,532 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:39:59,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-07 13:39:59,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87b4e370/0bd82b3924034f9c945c81085da68c4d/FLAG436f7283c [2019-10-07 13:40:00,064 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:00,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-07 13:40:00,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87b4e370/0bd82b3924034f9c945c81085da68c4d/FLAG436f7283c [2019-10-07 13:40:00,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87b4e370/0bd82b3924034f9c945c81085da68c4d [2019-10-07 13:40:00,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:00,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:00,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:00,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:00,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:00,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32635ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00, skipping insertion in model container [2019-10-07 13:40:00,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,459 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:00,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:00,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:00,678 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:00,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:00,818 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00 WrapperNode [2019-10-07 13:40:00,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:00,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:00,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:00,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:00,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (1/1) ... [2019-10-07 13:40:00,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:00,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:00,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:00,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:00,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40: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-10-07 13:40:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:01,332 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:01,332 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:40:01,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:01 BoogieIcfgContainer [2019-10-07 13:40:01,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:01,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:01,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:01,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:01,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:00" (1/3) ... [2019-10-07 13:40:01,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b488c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:01, skipping insertion in model container [2019-10-07 13:40:01,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:00" (2/3) ... [2019-10-07 13:40:01,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b488c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:01, skipping insertion in model container [2019-10-07 13:40:01,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:01" (3/3) ... [2019-10-07 13:40:01,342 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-07 13:40:01,351 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:01,360 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-07 13:40:01,371 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-07 13:40:01,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:01,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:01,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:01,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:01,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:01,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:01,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:01,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-10-07 13:40:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:40:01,423 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:01,424 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:01,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1595173234, now seen corresponding path program 1 times [2019-10-07 13:40:01,442 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:01,442 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:01,442 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:01,442 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:01,611 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:01,612 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:01,613 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:40:01,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:40:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:40:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:40:01,641 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-10-07 13:40:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:01,710 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2019-10-07 13:40:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:40:01,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:40:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:01,739 INFO L225 Difference]: With dead ends: 87 [2019-10-07 13:40:01,739 INFO L226 Difference]: Without dead ends: 75 [2019-10-07 13:40:01,746 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:40:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-07 13:40:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2019-10-07 13:40:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-07 13:40:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-07 13:40:01,810 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-10-07 13:40:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:01,810 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-07 13:40:01,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:40:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-07 13:40:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:40:01,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:01,813 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:01,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2086065458, now seen corresponding path program 1 times [2019-10-07 13:40:01,816 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:01,817 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:01,818 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:01,818 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:01,889 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:01,890 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:01,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:01,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:01,893 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-10-07 13:40:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,008 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2019-10-07 13:40:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:02,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:40:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,010 INFO L225 Difference]: With dead ends: 152 [2019-10-07 13:40:02,010 INFO L226 Difference]: Without dead ends: 100 [2019-10-07 13:40:02,012 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-07 13:40:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 57. [2019-10-07 13:40:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:40:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-07 13:40:02,023 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 13 [2019-10-07 13:40:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,023 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-07 13:40:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-07 13:40:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:40:02,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,025 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2089234227, now seen corresponding path program 1 times [2019-10-07 13:40:02,026 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,026 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,109 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,110 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:02,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:02,111 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2019-10-07 13:40:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,217 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-10-07 13:40:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:02,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:40:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,219 INFO L225 Difference]: With dead ends: 74 [2019-10-07 13:40:02,219 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 13:40:02,220 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 13:40:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-10-07 13:40:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-07 13:40:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-07 13:40:02,237 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 13 [2019-10-07 13:40:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-07 13:40:02,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-07 13:40:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:40:02,240 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,240 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -243516670, now seen corresponding path program 1 times [2019-10-07 13:40:02,247 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,247 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,294 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,295 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,295 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:02,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:02,296 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-10-07 13:40:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,397 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-10-07 13:40:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:02,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:40:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,399 INFO L225 Difference]: With dead ends: 95 [2019-10-07 13:40:02,400 INFO L226 Difference]: Without dead ends: 93 [2019-10-07 13:40:02,400 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-07 13:40:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 53. [2019-10-07 13:40:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 13:40:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-07 13:40:02,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 14 [2019-10-07 13:40:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,410 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-07 13:40:02,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-07 13:40:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:02,411 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,411 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1040920916, now seen corresponding path program 1 times [2019-10-07 13:40:02,413 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,413 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,413 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,413 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,485 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:02,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,498 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-10-07 13:40:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,616 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-10-07 13:40:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:02,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 13:40:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,618 INFO L225 Difference]: With dead ends: 94 [2019-10-07 13:40:02,618 INFO L226 Difference]: Without dead ends: 92 [2019-10-07 13:40:02,618 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-07 13:40:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 51. [2019-10-07 13:40:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-07 13:40:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-07 13:40:02,626 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 15 [2019-10-07 13:40:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,626 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-07 13:40:02,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-07 13:40:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:02,627 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,627 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2004240627, now seen corresponding path program 1 times [2019-10-07 13:40:02,629 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,629 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,629 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,629 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,679 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,679 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:02,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:02,680 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2019-10-07 13:40:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,746 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-10-07 13:40:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:02,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:40:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,747 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:40:02,747 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:40:02,748 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:40:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2019-10-07 13:40:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-07 13:40:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-07 13:40:02,755 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2019-10-07 13:40:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,755 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-07 13:40:02,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-07 13:40:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:02,756 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,756 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,757 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2091186872, now seen corresponding path program 1 times [2019-10-07 13:40:02,757 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,758 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,791 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,792 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,792 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:02,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:02,793 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 4 states. [2019-10-07 13:40:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:02,862 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2019-10-07 13:40:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:02,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:40:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:02,864 INFO L225 Difference]: With dead ends: 90 [2019-10-07 13:40:02,864 INFO L226 Difference]: Without dead ends: 88 [2019-10-07 13:40:02,864 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-07 13:40:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2019-10-07 13:40:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-07 13:40:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-07 13:40:02,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 16 [2019-10-07 13:40:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:02,871 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-07 13:40:02,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-07 13:40:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:02,872 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:02,872 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:02,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2001914178, now seen corresponding path program 1 times [2019-10-07 13:40:02,876 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:02,876 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:02,962 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:02,962 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:02,962 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:02,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:02,963 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-10-07 13:40:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,086 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-07 13:40:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:03,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,088 INFO L225 Difference]: With dead ends: 72 [2019-10-07 13:40:03,088 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 13:40:03,088 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 13:40:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 45. [2019-10-07 13:40:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-07 13:40:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-07 13:40:03,094 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2019-10-07 13:40:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,094 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-07 13:40:03,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-07 13:40:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:03,095 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,095 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,096 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1929794253, now seen corresponding path program 1 times [2019-10-07 13:40:03,096 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,097 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:03,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,149 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:03,149 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:03,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:03,151 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-10-07 13:40:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,248 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-10-07 13:40:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:03,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,249 INFO L225 Difference]: With dead ends: 60 [2019-10-07 13:40:03,249 INFO L226 Difference]: Without dead ends: 58 [2019-10-07 13:40:03,250 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-07 13:40:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2019-10-07 13:40:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 13:40:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-07 13:40:03,255 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 17 [2019-10-07 13:40:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,256 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-07 13:40:03,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-07 13:40:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:03,257 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,257 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,257 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash 305923428, now seen corresponding path program 1 times [2019-10-07 13:40:03,258 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,258 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,258 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,258 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:03,315 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,316 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:03,316 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:03,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:03,317 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-10-07 13:40:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,377 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-10-07 13:40:03,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:03,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:40:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,380 INFO L225 Difference]: With dead ends: 60 [2019-10-07 13:40:03,380 INFO L226 Difference]: Without dead ends: 58 [2019-10-07 13:40:03,382 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-07 13:40:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-10-07 13:40:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 13:40:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-07 13:40:03,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-10-07 13:40:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,391 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-07 13:40:03,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-07 13:40:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:40:03,392 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,392 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash 893694809, now seen corresponding path program 1 times [2019-10-07 13:40:03,396 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,396 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:03,470 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,470 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:03,471 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:03,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:03,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:03,472 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2019-10-07 13:40:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,547 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-10-07 13:40:03,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:03,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-07 13:40:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,549 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:40:03,549 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:40:03,549 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:40:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2019-10-07 13:40:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-07 13:40:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-07 13:40:03,563 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2019-10-07 13:40:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,564 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-07 13:40:03,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-07 13:40:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:40:03,565 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,565 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1934738442, now seen corresponding path program 1 times [2019-10-07 13:40:03,566 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,568 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:03,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,643 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:03,644 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:03,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:03,645 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-10-07 13:40:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,778 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-07 13:40:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:03,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-07 13:40:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,779 INFO L225 Difference]: With dead ends: 73 [2019-10-07 13:40:03,779 INFO L226 Difference]: Without dead ends: 71 [2019-10-07 13:40:03,780 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-07 13:40:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 37. [2019-10-07 13:40:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:40:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-07 13:40:03,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 20 [2019-10-07 13:40:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,785 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-07 13:40:03,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-07 13:40:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:40:03,786 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,786 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,787 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash -152647297, now seen corresponding path program 1 times [2019-10-07 13:40:03,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,787 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:03,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,845 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:03,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:03,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:03,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:03,847 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-10-07 13:40:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:03,979 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2019-10-07 13:40:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:03,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-07 13:40:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:03,980 INFO L225 Difference]: With dead ends: 61 [2019-10-07 13:40:03,980 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 13:40:03,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:40:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 13:40:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-10-07 13:40:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-07 13:40:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-07 13:40:03,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2019-10-07 13:40:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:03,988 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-07 13:40:03,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-07 13:40:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:40:03,989 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:03,989 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:03,990 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -437095760, now seen corresponding path program 1 times [2019-10-07 13:40:03,991 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:03,991 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:03,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:04,032 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,032 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:04,032 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:04,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:04,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:04,034 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-10-07 13:40:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:04,140 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-10-07 13:40:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:04,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-07 13:40:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:04,143 INFO L225 Difference]: With dead ends: 86 [2019-10-07 13:40:04,143 INFO L226 Difference]: Without dead ends: 84 [2019-10-07 13:40:04,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-07 13:40:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 33. [2019-10-07 13:40:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:40:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-07 13:40:04,152 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-07 13:40:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:04,153 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-07 13:40:04,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-07 13:40:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 13:40:04,154 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:04,154 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:04,156 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash -665063515, now seen corresponding path program 1 times [2019-10-07 13:40:04,157 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:04,157 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,157 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,157 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:04,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,226 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:04,226 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:04,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:04,227 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-10-07 13:40:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:04,360 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-10-07 13:40:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:04,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-07 13:40:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:04,362 INFO L225 Difference]: With dead ends: 59 [2019-10-07 13:40:04,362 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:40:04,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:40:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:40:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2019-10-07 13:40:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:40:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-07 13:40:04,367 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2019-10-07 13:40:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:04,368 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-07 13:40:04,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-07 13:40:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:40:04,369 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:04,369 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:04,369 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash 857870678, now seen corresponding path program 1 times [2019-10-07 13:40:04,370 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:04,370 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,370 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:04,424 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,425 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:04,425 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:04,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:04,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:04,426 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-07 13:40:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:04,588 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2019-10-07 13:40:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:04,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-07 13:40:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:04,589 INFO L225 Difference]: With dead ends: 124 [2019-10-07 13:40:04,589 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:40:04,591 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:40:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:40:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:40:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:40:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:40:04,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-07 13:40:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:04,592 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:40:04,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:40:04,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:40:04,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:40:04,843 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-10-07 13:40:04,986 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-10-07 13:40:05,485 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 9 [2019-10-07 13:40:05,781 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-10-07 13:40:05,965 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 18 [2019-10-07 13:40:05,968 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:05,968 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:05,968 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:05,968 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:40:05,968 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-10-07 13:40:05,969 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-10-07 13:40:05,971 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= main_~__VERIFIER_assert__cond~12 0))) (and .cse3 .cse2))))) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1) (and (and (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0)) .cse1) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2019-10-07 13:40:05,971 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-07 13:40:05,971 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-07 13:40:05,971 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-10-07 13:40:05,971 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-10-07 13:40:05,971 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-10-07 13:40:05,972 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-10-07 13:40:05,973 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-10-07 13:40:05,973 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-07 13:40:05,973 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-10-07 13:40:05,973 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2019-10-07 13:40:05,973 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-10-07 13:40:05,974 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-10-07 13:40:05,975 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-10-07 13:40:05,975 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-07 13:40:05,975 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-10-07 13:40:05,975 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-10-07 13:40:05,976 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-10-07 13:40:05,976 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2019-10-07 13:40:05,976 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-10-07 13:40:05,976 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-10-07 13:40:05,977 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-10-07 13:40:05,978 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2019-10-07 13:40:05,979 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-07 13:40:05,979 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-10-07 13:40:06,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:40:06 BoogieIcfgContainer [2019-10-07 13:40:06,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:40:06,013 INFO L168 Benchmark]: Toolchain (without parser) took 5569.31 ms. Allocated memory was 138.9 MB in the beginning and 274.7 MB in the end (delta: 135.8 MB). Free memory was 102.0 MB in the beginning and 156.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:06,014 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 13:40:06,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.84 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.0 MB in the beginning and 182.8 MB in the end (delta: -80.8 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:06,017 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 MB in the beginning and 180.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:06,017 INFO L168 Benchmark]: RCFGBuilder took 468.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 159.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:06,021 INFO L168 Benchmark]: TraceAbstraction took 4671.00 ms. Allocated memory was 203.9 MB in the beginning and 274.7 MB in the end (delta: 70.8 MB). Free memory was 159.1 MB in the beginning and 156.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:06,031 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 377.84 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.0 MB in the beginning and 182.8 MB in the end (delta: -80.8 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 MB in the beginning and 180.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 468.90 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 159.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4671.00 ms. Allocated memory was 203.9 MB in the beginning and 274.7 MB in the end (delta: 70.8 MB). Free memory was 159.1 MB in the beginning and 156.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: 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: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: 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: 252]: 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: 240]: 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: 224]: 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, 64 locations, 16 error locations. Result: SAFE, OverallTime: 4.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 920 SDtfs, 1254 SDslu, 758 SDs, 0 SdLazy, 795 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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.7s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 12140 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...