/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --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/array-industry-pattern/array_shadowinit.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:28:43,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:28:43,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:28:43,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:28:43,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:28:43,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:28:43,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:28:43,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:28:43,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:28:43,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:28:43,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:28:43,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:28:43,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:28:43,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:28:43,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:28:43,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:28:43,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:28:43,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:28:43,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:28:43,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:28:43,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:28:43,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:28:43,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:28:43,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:28:43,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:28:43,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:28:43,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:28:43,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:28:43,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:28:43,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:28:43,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:28:43,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:28:43,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:28:43,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:28:43,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:28:43,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:28:43,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:28:43,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:28:43,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:28:43,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:28:43,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:28:43,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:28:43,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:28:43,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:28:43,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:28:43,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:28:43,509 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:28:43,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:28:43,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:28:43,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:28:43,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:28:43,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:28:43,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:28:43,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:28:43,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:28:43,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:28:43,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:28:43,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:28:43,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:28:43,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:28:43,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:28:43,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:28:43,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:28:43,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:28:43,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:28:43,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:28:43,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:28:43,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:28:43,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:28:43,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:28:43,515 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-11-07 01:28:43,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:28:43,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:28:43,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:28:43,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:28:43,796 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:28:43,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_shadowinit.i [2019-11-07 01:28:43,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5414834/bf86f3b1c17d46aa8fa5ac6cec35f6ca/FLAGfdd92f304 [2019-11-07 01:28:44,278 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:28:44,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_shadowinit.i [2019-11-07 01:28:44,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5414834/bf86f3b1c17d46aa8fa5ac6cec35f6ca/FLAGfdd92f304 [2019-11-07 01:28:44,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5414834/bf86f3b1c17d46aa8fa5ac6cec35f6ca [2019-11-07 01:28:44,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:28:44,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:28:44,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:28:44,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:28:44,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:28:44,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:28:44" (1/1) ... [2019-11-07 01:28:44,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329037be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:44, skipping insertion in model container [2019-11-07 01:28:44,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:28:44" (1/1) ... [2019-11-07 01:28:44,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:28:44,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:28:44,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:28:44,982 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:28:45,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:28:45,023 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:28:45,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45 WrapperNode [2019-11-07 01:28:45,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:28:45,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:28:45,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:28:45,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:28:45,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... [2019-11-07 01:28:45,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:28:45,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:28:45,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:28:45,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:28:45,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:28:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:28:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:28:45,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 01:28:45,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:28:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:28:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 01:28:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:28:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:28:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 01:28:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 01:28:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 01:28:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 01:28:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:28:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:28:45,478 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:28:45,478 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 01:28:45,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:28:45 BoogieIcfgContainer [2019-11-07 01:28:45,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:28:45,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:28:45,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:28:45,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:28:45,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:28:44" (1/3) ... [2019-11-07 01:28:45,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a26232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:28:45, skipping insertion in model container [2019-11-07 01:28:45,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:28:45" (2/3) ... [2019-11-07 01:28:45,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a26232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:28:45, skipping insertion in model container [2019-11-07 01:28:45,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:28:45" (3/3) ... [2019-11-07 01:28:45,488 INFO L109 eAbstractionObserver]: Analyzing ICFG array_shadowinit.i [2019-11-07 01:28:45,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:28:45,512 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:28:45,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:28:45,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:28:45,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:28:45,552 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:28:45,553 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:28:45,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:28:45,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:28:45,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:28:45,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:28:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-07 01:28:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 01:28:45,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:45,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:45,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1398188510, now seen corresponding path program 1 times [2019-11-07 01:28:45,588 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:45,588 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916245729] [2019-11-07 01:28:45,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:45,797 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916245729] [2019-11-07 01:28:45,798 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:28:45,799 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:28:45,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620977799] [2019-11-07 01:28:45,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:28:45,810 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:28:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:28:45,835 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-07 01:28:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:28:45,949 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-07 01:28:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:28:45,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-07 01:28:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:28:45,965 INFO L225 Difference]: With dead ends: 34 [2019-11-07 01:28:45,965 INFO L226 Difference]: Without dead ends: 17 [2019-11-07 01:28:45,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:28:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-07 01:28:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-07 01:28:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-07 01:28:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-07 01:28:46,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-11-07 01:28:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:28:46,027 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-07 01:28:46,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:28:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-07 01:28:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 01:28:46,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:46,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:46,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2852601, now seen corresponding path program 1 times [2019-11-07 01:28:46,032 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:46,032 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169394591] [2019-11-07 01:28:46,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:46,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169394591] [2019-11-07 01:28:46,377 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378853114] [2019-11-07 01:28:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 01:28:46,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:28:46,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-07 01:28:46,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 01:28:46,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-07 01:28:46,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-07 01:28:46,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 01:28:46,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-07 01:28:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:46,622 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:28:46,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-07 01:28:46,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2019-11-07 01:28:46,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-07 01:28:46,730 INFO L567 ElimStorePlain]: treesize reduction 4, result has 63.6 percent of original size [2019-11-07 01:28:46,731 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 01:28:46,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 01:28:46,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-11-07 01:28:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:46,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [728656944] [2019-11-07 01:28:46,826 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-07 01:28:46,826 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:28:46,835 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:28:46,842 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:28:46,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:28:46,970 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:28:47,191 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:28:47,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:28:47,208 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:28:47,916 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:28:47,916 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-11-07 01:28:47,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427724950] [2019-11-07 01:28:47,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-07 01:28:47,920 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-07 01:28:47,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-11-07 01:28:47,926 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 25 states. [2019-11-07 01:28:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:28:48,587 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-07 01:28:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 01:28:48,593 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2019-11-07 01:28:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:28:48,594 INFO L225 Difference]: With dead ends: 26 [2019-11-07 01:28:48,594 INFO L226 Difference]: Without dead ends: 24 [2019-11-07 01:28:48,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2019-11-07 01:28:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-07 01:28:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-07 01:28:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-07 01:28:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-07 01:28:48,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-11-07 01:28:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:28:48,604 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-07 01:28:48,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-07 01:28:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-07 01:28:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 01:28:48,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:48,605 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:48,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:48,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1841809294, now seen corresponding path program 1 times [2019-11-07 01:28:48,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:48,810 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102620776] [2019-11-07 01:28:48,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:48,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102620776] [2019-11-07 01:28:48,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466409881] [2019-11-07 01:28:48,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:48,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 01:28:48,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:28:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:48,979 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:28:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:49,004 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1150779264] [2019-11-07 01:28:49,005 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:28:49,007 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:28:49,007 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:28:49,008 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:28:49,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:28:49,047 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-11-07 01:28:49,401 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:28:49,407 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:28:49,409 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:28:50,025 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:28:50,026 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 12] total 23 [2019-11-07 01:28:50,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180229564] [2019-11-07 01:28:50,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-07 01:28:50,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-07 01:28:50,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-11-07 01:28:50,030 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 23 states. [2019-11-07 01:28:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:28:51,098 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-07 01:28:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-07 01:28:51,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-11-07 01:28:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:28:51,101 INFO L225 Difference]: With dead ends: 45 [2019-11-07 01:28:51,101 INFO L226 Difference]: Without dead ends: 28 [2019-11-07 01:28:51,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2019-11-07 01:28:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-07 01:28:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-07 01:28:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-07 01:28:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-07 01:28:51,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-11-07 01:28:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:28:51,114 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-07 01:28:51,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-07 01:28:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-07 01:28:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 01:28:51,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:51,115 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:51,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:51,321 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash -501757299, now seen corresponding path program 2 times [2019-11-07 01:28:51,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:51,323 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646718781] [2019-11-07 01:28:51,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:51,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646718781] [2019-11-07 01:28:51,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906035039] [2019-11-07 01:28:51,507 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:51,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-07 01:28:51,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:28:51,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 01:28:51,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:28:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:51,804 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:28:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:28:51,905 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1042877623] [2019-11-07 01:28:51,906 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:28:51,906 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:28:51,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:28:51,907 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:28:51,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:28:51,933 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-11-07 01:28:52,203 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:28:52,210 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:28:52,211 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:28:52,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:28:52,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 12] total 35 [2019-11-07 01:28:52,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349166333] [2019-11-07 01:28:52,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-07 01:28:52,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-07 01:28:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2019-11-07 01:28:52,946 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 35 states. [2019-11-07 01:28:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:28:54,368 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-07 01:28:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 01:28:54,368 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 21 [2019-11-07 01:28:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:28:54,370 INFO L225 Difference]: With dead ends: 32 [2019-11-07 01:28:54,370 INFO L226 Difference]: Without dead ends: 30 [2019-11-07 01:28:54,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=268, Invalid=2282, Unknown=0, NotChecked=0, Total=2550 [2019-11-07 01:28:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-07 01:28:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-07 01:28:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-07 01:28:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-07 01:28:54,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-11-07 01:28:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:28:54,381 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-07 01:28:54,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-07 01:28:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-07 01:28:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 01:28:54,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:54,383 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:54,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:54,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -340228514, now seen corresponding path program 3 times [2019-11-07 01:28:54,589 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:54,589 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794373403] [2019-11-07 01:28:54,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:54,676 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794373403] [2019-11-07 01:28:54,676 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781814997] [2019-11-07 01:28:54,676 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:54,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 01:28:54,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:28:54,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 01:28:54,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:28:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:54,786 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:28:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:54,834 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875763848] [2019-11-07 01:28:54,835 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:28:54,835 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:28:54,837 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:28:54,837 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:28:54,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:28:54,857 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-11-07 01:28:55,072 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:28:55,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:28:55,083 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:28:55,656 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:28:55,656 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 12] total 26 [2019-11-07 01:28:55,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140553254] [2019-11-07 01:28:55,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-07 01:28:55,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-07 01:28:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-11-07 01:28:55,659 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 26 states. [2019-11-07 01:28:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:28:57,199 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-11-07 01:28:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-07 01:28:57,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-11-07 01:28:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:28:57,200 INFO L225 Difference]: With dead ends: 58 [2019-11-07 01:28:57,201 INFO L226 Difference]: Without dead ends: 34 [2019-11-07 01:28:57,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=2096, Unknown=0, NotChecked=0, Total=2450 [2019-11-07 01:28:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-07 01:28:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-07 01:28:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 01:28:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-07 01:28:57,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2019-11-07 01:28:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:28:57,212 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-07 01:28:57,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-07 01:28:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-07 01:28:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:28:57,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:28:57,213 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:28:57,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:57,419 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:28:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:28:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1759654535, now seen corresponding path program 4 times [2019-11-07 01:28:57,420 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:28:57,420 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975342173] [2019-11-07 01:28:57,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:28:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:57,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975342173] [2019-11-07 01:28:57,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140227929] [2019-11-07 01:28:57,578 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:28:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:28:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-07 01:28:57,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:28:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:57,915 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:28:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:28:57,973 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1762274422] [2019-11-07 01:28:57,974 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:28:57,975 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:28:57,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:28:57,975 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:28:57,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:28:57,991 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:28:58,157 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:28:58,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:28:58,165 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:28:59,006 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:28:59,007 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 12] total 36 [2019-11-07 01:28:59,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357320504] [2019-11-07 01:28:59,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-07 01:28:59,009 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:28:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-07 01:28:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2019-11-07 01:28:59,010 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 36 states. [2019-11-07 01:29:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:29:00,720 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-07 01:29:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-07 01:29:00,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 29 [2019-11-07 01:29:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:29:00,723 INFO L225 Difference]: With dead ends: 38 [2019-11-07 01:29:00,723 INFO L226 Difference]: Without dead ends: 36 [2019-11-07 01:29:00,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=305, Invalid=2775, Unknown=0, NotChecked=0, Total=3080 [2019-11-07 01:29:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-07 01:29:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-07 01:29:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 01:29:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-07 01:29:00,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2019-11-07 01:29:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:29:00,735 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-07 01:29:00,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-07 01:29:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-07 01:29:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 01:29:00,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:29:00,737 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:29:00,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:00,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:29:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:29:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 702652914, now seen corresponding path program 5 times [2019-11-07 01:29:00,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:29:00,942 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669766798] [2019-11-07 01:29:00,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:29:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:01,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669766798] [2019-11-07 01:29:01,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971515417] [2019-11-07 01:29:01,025 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:01,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-07 01:29:01,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:29:01,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-07 01:29:01,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:29:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:01,183 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:29:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:01,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835950814] [2019-11-07 01:29:01,230 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:29:01,230 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:29:01,230 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:29:01,231 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:29:01,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:29:01,252 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:29:01,502 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:29:01,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:29:01,512 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:29:02,445 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:29:02,445 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 12] total 29 [2019-11-07 01:29:02,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518592750] [2019-11-07 01:29:02,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-07 01:29:02,448 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:29:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-07 01:29:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-11-07 01:29:02,454 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2019-11-07 01:29:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:29:04,309 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-07 01:29:04,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-07 01:29:04,309 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-11-07 01:29:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:29:04,311 INFO L225 Difference]: With dead ends: 65 [2019-11-07 01:29:04,311 INFO L226 Difference]: Without dead ends: 38 [2019-11-07 01:29:04,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=495, Invalid=2927, Unknown=0, NotChecked=0, Total=3422 [2019-11-07 01:29:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-07 01:29:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-07 01:29:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 01:29:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-07 01:29:04,322 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-07 01:29:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:29:04,322 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-07 01:29:04,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-07 01:29:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-07 01:29:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 01:29:04,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:29:04,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:29:04,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:04,528 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:29:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:29:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1044880909, now seen corresponding path program 6 times [2019-11-07 01:29:04,529 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:29:04,529 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957044633] [2019-11-07 01:29:04,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:29:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:04,714 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957044633] [2019-11-07 01:29:04,714 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140189200] [2019-11-07 01:29:04,714 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:04,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 01:29:04,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:29:04,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-07 01:29:04,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:29:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:05,231 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:29:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 01:29:05,299 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070525313] [2019-11-07 01:29:05,300 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:29:05,300 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:29:05,300 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:29:05,300 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:29:05,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:29:05,324 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-11-07 01:29:05,500 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:29:05,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:29:05,510 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:29:06,419 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:29:06,419 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 12] total 40 [2019-11-07 01:29:06,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577979438] [2019-11-07 01:29:06,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-07 01:29:06,422 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:29:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-07 01:29:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2019-11-07 01:29:06,423 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 40 states. [2019-11-07 01:29:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:29:08,726 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-07 01:29:08,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 01:29:08,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 37 [2019-11-07 01:29:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:29:08,728 INFO L225 Difference]: With dead ends: 42 [2019-11-07 01:29:08,728 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 01:29:08,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=361, Invalid=3671, Unknown=0, NotChecked=0, Total=4032 [2019-11-07 01:29:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 01:29:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-07 01:29:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 01:29:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-07 01:29:08,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 37 [2019-11-07 01:29:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:29:08,741 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-07 01:29:08,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-07 01:29:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-07 01:29:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 01:29:08,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:29:08,743 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:29:08,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:08,947 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:29:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:29:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -717503778, now seen corresponding path program 7 times [2019-11-07 01:29:08,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:29:08,948 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059743397] [2019-11-07 01:29:08,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:29:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 01:29:09,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059743397] [2019-11-07 01:29:09,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549346568] [2019-11-07 01:29:09,050 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:09,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-07 01:29:09,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:29:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 01:29:09,229 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:29:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 01:29:09,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019676971] [2019-11-07 01:29:09,319 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:29:09,320 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:29:09,320 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:29:09,320 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:29:09,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:29:09,338 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:29:09,491 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:29:09,499 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:29:09,501 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:29:10,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:29:10,119 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 12] total 32 [2019-11-07 01:29:10,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435616620] [2019-11-07 01:29:10,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-07 01:29:10,121 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:29:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-07 01:29:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-11-07 01:29:10,123 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 32 states. [2019-11-07 01:29:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:29:12,444 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-07 01:29:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-07 01:29:12,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-11-07 01:29:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:29:12,447 INFO L225 Difference]: With dead ends: 72 [2019-11-07 01:29:12,447 INFO L226 Difference]: Without dead ends: 42 [2019-11-07 01:29:12,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 105 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=664, Invalid=3892, Unknown=0, NotChecked=0, Total=4556 [2019-11-07 01:29:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-07 01:29:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-07 01:29:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-07 01:29:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-07 01:29:12,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 44 [2019-11-07 01:29:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:29:12,460 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-07 01:29:12,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-07 01:29:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-07 01:29:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 01:29:12,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:29:12,461 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:29:12,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:12,665 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:29:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:29:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1256360967, now seen corresponding path program 8 times [2019-11-07 01:29:12,666 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:29:12,666 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327103769] [2019-11-07 01:29:12,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:29:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 01:29:13,012 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327103769] [2019-11-07 01:29:13,012 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059640449] [2019-11-07 01:29:13,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:13,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-07 01:29:13,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:29:13,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-07 01:29:13,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:29:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-07 01:29:13,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:29:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 01:29:14,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1777873901] [2019-11-07 01:29:14,499 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:29:14,499 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:29:14,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:29:14,500 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:29:14,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:29:14,523 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:29:14,673 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:29:14,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:29:14,682 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:29:15,827 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:29:15,828 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16, 12] total 56 [2019-11-07 01:29:15,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192044595] [2019-11-07 01:29:15,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-07 01:29:15,829 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:29:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-07 01:29:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2019-11-07 01:29:15,831 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 56 states. [2019-11-07 01:29:21,301 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-07 01:29:21,496 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-11-07 01:29:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:29:21,808 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-07 01:29:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-07 01:29:21,808 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 45 [2019-11-07 01:29:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:29:21,811 INFO L225 Difference]: With dead ends: 74 [2019-11-07 01:29:21,811 INFO L226 Difference]: Without dead ends: 44 [2019-11-07 01:29:21,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=931, Invalid=9781, Unknown=0, NotChecked=0, Total=10712 [2019-11-07 01:29:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-07 01:29:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-07 01:29:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 01:29:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-07 01:29:21,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 45 [2019-11-07 01:29:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:29:21,827 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-07 01:29:21,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-07 01:29:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-07 01:29:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 01:29:21,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:29:21,828 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:29:22,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:22,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:29:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:29:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1971982733, now seen corresponding path program 9 times [2019-11-07 01:29:22,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 01:29:22,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569589755] [2019-11-07 01:29:22,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:29:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:29:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-07 01:29:22,300 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569589755] [2019-11-07 01:29:22,300 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389478490] [2019-11-07 01:29:22,301 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:29:22,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 01:29:22,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:29:22,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-07 01:29:22,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:29:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-07 01:29:23,063 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:29:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-07 01:29:23,133 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331450347] [2019-11-07 01:29:23,134 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-07 01:29:23,134 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 01:29:23,134 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 01:29:23,134 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 01:29:23,135 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 01:29:23,149 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 01:29:23,288 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 01:29:23,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-11-07 01:29:23,296 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 01:29:24,298 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 01:29:24,299 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18, 12] total 48 [2019-11-07 01:29:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358232241] [2019-11-07 01:29:24,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-07 01:29:24,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 01:29:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-07 01:29:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2107, Unknown=0, NotChecked=0, Total=2256 [2019-11-07 01:29:24,301 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 48 states.