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-crafted/bAnd3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:40,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:40,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:40,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:40,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:40,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:40,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:40,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:40,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:40,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:40,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:40,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:40,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:40,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:40,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:40,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:40,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:40,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:40,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:41,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:41,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:41,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:41,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:41,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:41,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:41,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:41,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:41,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:41,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:41,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:41,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:41,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:41,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:41,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:41,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:41,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:41,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:41,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:41,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:41,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:41,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:41,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:29:41,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:41,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:41,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:41,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:41,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:41,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:41,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:41,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:41,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:41,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:41,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:41,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:41,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:41,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:41,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:41,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:41,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:41,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:41,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:41,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:41,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:41,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:41,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:41,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:41,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:41,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:41,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:41,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:41,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:29:41,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:41,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:41,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:41,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:41,350 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:41,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd3.i [2019-10-15 01:29:41,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/216cdfcee/46c5eece10674391b82ead58157dd36c/FLAGf469d7698 [2019-10-15 01:29:41,902 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:41,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd3.i [2019-10-15 01:29:41,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/216cdfcee/46c5eece10674391b82ead58157dd36c/FLAGf469d7698 [2019-10-15 01:29:42,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/216cdfcee/46c5eece10674391b82ead58157dd36c [2019-10-15 01:29:42,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:42,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:42,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:42,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:42,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddb9b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42, skipping insertion in model container [2019-10-15 01:29:42,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:42,379 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:42,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,618 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:42,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:42,732 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:42,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42 WrapperNode [2019-10-15 01:29:42,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:42,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:42,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:42,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... [2019-10-15 01:29:42,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:42,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:42,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:42,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:42,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:42,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:42,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:42,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2019-10-15 01:29:42,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2019-10-15 01:29:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:43,221 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:43,221 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:43,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43 BoogieIcfgContainer [2019-10-15 01:29:43,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:43,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:43,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:43,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:43,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:42" (1/3) ... [2019-10-15 01:29:43,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272c5434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:42" (2/3) ... [2019-10-15 01:29:43,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272c5434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:43, skipping insertion in model container [2019-10-15 01:29:43,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:43" (3/3) ... [2019-10-15 01:29:43,230 INFO L109 eAbstractionObserver]: Analyzing ICFG bAnd3.i [2019-10-15 01:29:43,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:43,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:43,255 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:43,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:43,277 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:43,277 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:43,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:43,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:43,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:43,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:43,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:29:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:29:43,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,306 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,307 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1674969442, now seen corresponding path program 1 times [2019-10-15 01:29:43,319 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051026708] [2019-10-15 01:29:43,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:43,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051026708] [2019-10-15 01:29:43,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:43,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:43,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166396705] [2019-10-15 01:29:43,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:43,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,540 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 01:29:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:43,594 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 01:29:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:43,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:29:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:43,610 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:29:43,611 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:29:43,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:29:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:29:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:29:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 01:29:43,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 01:29:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:43,674 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 01:29:43,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 01:29:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:43,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:43,679 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:43,680 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2035795135, now seen corresponding path program 1 times [2019-10-15 01:29:43,681 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:43,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308699479] [2019-10-15 01:29:43,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:43,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:43,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308699479] [2019-10-15 01:29:43,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429316067] [2019-10-15 01:29:43,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:43,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:43,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:43,978 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:44,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:44,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 01:29:44,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166123690] [2019-10-15 01:29:44,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:44,015 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 01:29:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,024 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 01:29:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,026 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:44,026 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:44,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:44,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,034 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:44,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:29:44,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -629127273, now seen corresponding path program 1 times [2019-10-15 01:29:44,241 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716723579] [2019-10-15 01:29:44,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716723579] [2019-10-15 01:29:44,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:44,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:44,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2938486] [2019-10-15 01:29:44,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:44,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:44,368 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 01:29:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:44,384 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 01:29:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:44,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:29:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:44,386 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:29:44,386 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:29:44,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:29:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:29:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:29:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 01:29:44,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 01:29:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:44,396 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 01:29:44,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 01:29:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:29:44,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:44,398 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:44,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1942163656, now seen corresponding path program 1 times [2019-10-15 01:29:44,399 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:44,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181960985] [2019-10-15 01:29:44,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:44,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181960985] [2019-10-15 01:29:44,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282583356] [2019-10-15 01:29:44,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:44,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:44,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,615 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:44,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202605230] [2019-10-15 01:29:44,692 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:44,692 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:44,698 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:44,707 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:44,707 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:44,877 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:47,071 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:47,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:47,137 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:47,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:47,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:29:47,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866839050] [2019-10-15 01:29:47,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:29:47,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:29:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:29:47,648 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 01:29:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:48,314 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 01:29:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:29:48,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 01:29:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:48,317 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:29:48,318 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:29:48,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:29:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:29:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:29:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:29:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 01:29:48,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 01:29:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:48,331 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 01:29:48,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:29:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 01:29:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:29:48,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:48,334 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:48,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:48,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 143191253, now seen corresponding path program 2 times [2019-10-15 01:29:48,542 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:48,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661473906] [2019-10-15 01:29:48,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:48,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:48,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661473906] [2019-10-15 01:29:48,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402688175] [2019-10-15 01:29:48,627 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-10-15 01:29:48,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:29:48,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:48,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,763 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:48,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1084004577] [2019-10-15 01:29:48,801 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:48,802 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:48,803 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:48,803 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:48,803 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:48,834 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:50,296 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:50,326 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:50,331 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:50,851 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:50,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 01:29:50,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337094961] [2019-10-15 01:29:50,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:29:50,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:50,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:29:50,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:29:50,855 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 01:29:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:51,985 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 01:29:51,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:29:51,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 01:29:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:51,986 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:29:51,986 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:29:51,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:29:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:29:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:29:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:29:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 01:29:51,995 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 01:29:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:51,995 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 01:29:51,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:29:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 01:29:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:29:51,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:51,997 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:52,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:52,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 766317228, now seen corresponding path program 3 times [2019-10-15 01:29:52,207 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:52,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680427528] [2019-10-15 01:29:52,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:52,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:52,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680427528] [2019-10-15 01:29:52,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2602778] [2019-10-15 01:29:52,307 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-10-15 01:29:52,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:29:52,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:29:52,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,465 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:52,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697374483] [2019-10-15 01:29:52,549 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:52,549 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:52,550 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:52,550 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:52,550 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:52,571 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:53,896 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:53,919 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:53,922 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:54,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:54,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 01:29:54,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609003132] [2019-10-15 01:29:54,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:29:54,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:29:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:29:54,299 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 01:29:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:57,201 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 01:29:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:29:57,202 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 01:29:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:57,202 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:29:57,203 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:29:57,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:29:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:29:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:29:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:29:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:29:57,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 01:29:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:57,212 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:29:57,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:29:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:29:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:29:57,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:57,214 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:57,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:57,418 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash 615727983, now seen corresponding path program 4 times [2019-10-15 01:29:57,419 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:57,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878942202] [2019-10-15 01:29:57,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:57,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:57,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:57,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878942202] [2019-10-15 01:29:57,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857692523] [2019-10-15 01:29:57,648 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-10-15 01:29:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:57,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:29:57,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:57,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:29:58,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2078926581] [2019-10-15 01:29:58,109 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:58,109 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:58,110 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:58,110 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:58,110 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:58,128 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:59,416 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:29:59,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:59,447 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:00,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:00,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-15 01:30:00,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512784081] [2019-10-15 01:30:00,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 01:30:00,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:00,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 01:30:00,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:30:00,008 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-15 01:30:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:01,617 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-15 01:30:01,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:30:01,617 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-15 01:30:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:01,619 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:30:01,619 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:30:01,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 01:30:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:30:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-15 01:30:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:30:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:30:01,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-15 01:30:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:01,632 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:30:01,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 01:30:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:30:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:30:01,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:01,634 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:01,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:01,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2121294031, now seen corresponding path program 5 times [2019-10-15 01:30:01,837 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:01,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411429206] [2019-10-15 01:30:01,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:02,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411429206] [2019-10-15 01:30:02,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960538509] [2019-10-15 01:30:02,270 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-10-15 01:30:02,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:02,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:02,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:30:02,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-15 01:30:02,501 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-15 01:30:02,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645621983] [2019-10-15 01:30:02,544 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:02,544 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:02,545 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:02,545 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:02,545 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:02,564 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:03,790 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:03,810 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:03,812 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:04,332 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:04,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-15 01:30:04,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709867934] [2019-10-15 01:30:04,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:04,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:04,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:04,335 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-15 01:30:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:08,563 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-15 01:30:08,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 01:30:08,563 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-15 01:30:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:08,564 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:30:08,565 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:30:08,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-15 01:30:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:30:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:30:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:30:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:30:08,576 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-15 01:30:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:08,577 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:30:08,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:30:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:30:08,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:08,578 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:08,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:08,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1728770399, now seen corresponding path program 6 times [2019-10-15 01:30:08,783 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:08,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523469327] [2019-10-15 01:30:08,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:08,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:08,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:09,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523469327] [2019-10-15 01:30:09,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631346456] [2019-10-15 01:30:09,222 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-10-15 01:30:09,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:09,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:09,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:09,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:09,467 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:10,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641680554] [2019-10-15 01:30:10,390 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:10,391 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:10,391 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:10,391 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:10,391 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:10,408 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:11,627 INFO L199 IcfgInterpreter]: Interpreting procedure bAnd with input of size 1 for LOIs [2019-10-15 01:30:11,645 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:11,647 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:12,102 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:12,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-15 01:30:12,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31618370] [2019-10-15 01:30:12,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:30:12,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:12,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:30:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:30:12,106 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-15 01:30:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:17,458 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-15 01:30:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-15 01:30:17,458 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-15 01:30:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:17,459 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:30:17,459 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:30:17,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5099, Invalid=12723, Unknown=0, NotChecked=0, Total=17822 [2019-10-15 01:30:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:30:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:30:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:30:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-15 01:30:17,475 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-15 01:30:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:17,476 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-15 01:30:17,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:30:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-15 01:30:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:30:17,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:17,477 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:17,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:17,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1695588190, now seen corresponding path program 7 times [2019-10-15 01:30:17,682 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:17,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644343832] [2019-10-15 01:30:17,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:17,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:17,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:19,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644343832] [2019-10-15 01:30:19,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636007832] [2019-10-15 01:30:19,025 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-10-15 01:30:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:19,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-15 01:30:19,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:19,322 INFO L321 TraceCheckSpWp]: Computing backward predicates...