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-examples/standard_two_index_02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:24:37,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:24:37,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:24:37,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:24:37,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:24:37,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:24:37,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:24:37,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:24:37,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:24:37,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:24:37,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:24:37,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:24:37,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:24:37,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:24:37,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:24:37,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:24:37,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:24:37,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:24:37,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:24:37,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:24:37,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:24:37,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:24:37,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:24:37,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:24:37,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:24:37,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:24:37,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:24:37,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:24:37,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:24:37,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:24:37,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:24:37,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:24:37,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:24:37,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:24:37,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:24:37,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:24:37,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:24:37,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:24:37,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:24:37,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:24:37,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:24:37,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:24:37,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:24:37,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:24:37,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:24:37,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:24:37,794 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:24:37,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:24:37,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:24:37,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:24:37,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:24:37,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:24:37,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:24:37,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:24:37,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:24:37,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:24:37,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:24:37,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:24:37,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:37,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:24:37,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:24:37,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:24:37,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:24:37,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:24:37,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:24:37,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:24:38,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:24:38,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:24:38,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:24:38,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:24:38,126 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:24:38,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_02.i [2019-10-07 00:24:38,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaacf801/83fccae685324dd38388598aff66e11e/FLAG3d3a9894e [2019-10-07 00:24:38,662 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:24:38,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_02.i [2019-10-07 00:24:38,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaacf801/83fccae685324dd38388598aff66e11e/FLAG3d3a9894e [2019-10-07 00:24:39,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caaacf801/83fccae685324dd38388598aff66e11e [2019-10-07 00:24:39,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:24:39,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:24:39,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:39,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:24:39,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:24:39,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d5787d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39, skipping insertion in model container [2019-10-07 00:24:39,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:24:39,084 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:24:39,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:39,274 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:24:39,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:39,320 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:24:39,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39 WrapperNode [2019-10-07 00:24:39,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:39,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:24:39,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:24:39,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:24:39,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... [2019-10-07 00:24:39,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:24:39,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:24:39,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:24:39,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:24:39,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:24:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:24:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:24:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:24:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:24:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:24:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:24:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:24:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:24:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:24:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:24:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:24:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:24:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:24:39,821 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:24:39,821 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:24:39,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:39 BoogieIcfgContainer [2019-10-07 00:24:39,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:24:39,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:24:39,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:24:39,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:24:39,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:24:39" (1/3) ... [2019-10-07 00:24:39,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c87c6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:39, skipping insertion in model container [2019-10-07 00:24:39,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:39" (2/3) ... [2019-10-07 00:24:39,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c87c6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:39, skipping insertion in model container [2019-10-07 00:24:39,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:39" (3/3) ... [2019-10-07 00:24:39,841 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_02.i [2019-10-07 00:24:39,849 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:24:39,855 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:24:39,864 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:24:39,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:24:39,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:24:39,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:24:39,886 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:24:39,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:24:39,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:24:39,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:24:39,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:24:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:24:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:24:39,905 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:39,906 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:39,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:24:39,920 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:39,920 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:39,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:39,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:40,089 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,089 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:40,090 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:40,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:40,106 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:24:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:40,169 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:24:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:40,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:24:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:40,179 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:24:40,179 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:24:40,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:24:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:24:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:24:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:24:40,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:24:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:40,222 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:24:40,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:24:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:24:40,223 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:40,223 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:40,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-07 00:24:40,225 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:40,225 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,225 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:40,293 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,294 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:40,294 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:40,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:40,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:40,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:40,297 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:24:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:40,358 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:24:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:40,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:24:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:40,362 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:24:40,362 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:24:40,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:24:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:24:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:24:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:24:40,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:24:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:40,373 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:24:40,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:24:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:24:40,374 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:40,375 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:40,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:24:40,376 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:40,376 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,376 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,376 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:40,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,458 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:40,458 INFO L95 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-07 00:24:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:40,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:40,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:40,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:40,636 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:40,672 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:40,672 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:40,679 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:40,691 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:40,691 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:40,856 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:41,340 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 00:24:41,475 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:24:41,504 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:41,513 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:41,513 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:41,514 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,514 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:41,514 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,515 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:41,515 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:24:41,515 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 8 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:41,515 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,516 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:41,517 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,518 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:41,518 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-07 00:24:41,849 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:41,849 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:24:41,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:24:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:24:41,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:24:41,852 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:24:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:42,647 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-07 00:24:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:24:42,648 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:24:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:42,649 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:24:42,650 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:24:42,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:24:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:24:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-07 00:24:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:24:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:24:42,666 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:24:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:42,667 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:24:42,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:24:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:24:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:24:42,669 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:42,669 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:42,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:42,873 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-07 00:24:42,875 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:42,875 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:42,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:42,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:24:42,989 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:42,989 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:42,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 00:24:43,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:24:43,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:43,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:24:43,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:24:43,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:24:43,095 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:43,096 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:43,096 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:43,097 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:43,097 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:43,097 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:43,130 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:43,462 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:24:43,481 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:43,488 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:43,488 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:43,488 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:43,489 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:43,489 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:43,489 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:43,490 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:24:43,491 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 8 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:43,491 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:43,491 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:43,491 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:43,492 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:43,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:43,492 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:43,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-07 00:24:43,758 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:43,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-07 00:24:43,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:24:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:24:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:24:43,761 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-07 00:24:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:44,835 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-07 00:24:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:24:44,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-07 00:24:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:44,837 INFO L225 Difference]: With dead ends: 73 [2019-10-07 00:24:44,838 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:24:44,839 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:24:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:24:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-07 00:24:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:24:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:24:44,849 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-07 00:24:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:44,850 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:24:44,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:24:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:24:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:24:44,851 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:44,851 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:45,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:45,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-07 00:24:45,058 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:45,058 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:45,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:45,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:24:45,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:45,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:45,192 INFO L93 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 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-07 00:24:45,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:24:45,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:45,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:24:45,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:24:45,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:24:45,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:45,461 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:45,461 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:45,461 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:45,462 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:45,462 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:45,508 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:45,844 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:24:45,863 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:45,870 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:45,870 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:45,871 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:45,871 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:45,872 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:45,872 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:45,872 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:24:45,873 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 8 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:45,873 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:45,873 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:45,874 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:45,874 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:45,875 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:45,875 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:45,875 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:24:46,268 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:46,270 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 36 [2019-10-07 00:24:46,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-07 00:24:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-07 00:24:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 00:24:46,273 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 36 states. [2019-10-07 00:24:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:48,316 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2019-10-07 00:24:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:24:48,317 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 28 [2019-10-07 00:24:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:48,319 INFO L225 Difference]: With dead ends: 117 [2019-10-07 00:24:48,319 INFO L226 Difference]: Without dead ends: 99 [2019-10-07 00:24:48,324 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1654, Invalid=4666, Unknown=0, NotChecked=0, Total=6320 [2019-10-07 00:24:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-07 00:24:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 53. [2019-10-07 00:24:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 00:24:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-07 00:24:48,338 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2019-10-07 00:24:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:48,339 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-07 00:24:48,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-07 00:24:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-07 00:24:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 00:24:48,340 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:48,340 INFO L385 BasicCegarLoop]: trace histogram [23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:48,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:48,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1631926200, now seen corresponding path program 4 times [2019-10-07 00:24:48,546 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:48,546 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:48,546 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:48,546 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-07 00:24:48,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:48,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:48,843 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-07 00:24:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:48,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 00:24:48,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:24:49,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:24:49,639 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:49,641 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:49,641 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:49,642 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:49,642 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:49,642 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:49,694 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:49,982 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:24:49,991 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:49,996 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:49,996 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:49,996 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:49,997 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:49,997 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:49,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:49,998 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:24:49,998 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 8 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:24:49,998 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:49,998 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:49,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:49,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:50,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:50,000 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:50,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:24:50,320 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:50,321 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 26, 11] total 64 [2019-10-07 00:24:50,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-07 00:24:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-07 00:24:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=2470, Unknown=0, NotChecked=0, Total=4032 [2019-10-07 00:24:50,325 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 64 states. [2019-10-07 00:24:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:55,160 INFO L93 Difference]: Finished difference Result 205 states and 275 transitions. [2019-10-07 00:24:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-07 00:24:55,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 49 [2019-10-07 00:24:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:55,163 INFO L225 Difference]: With dead ends: 205 [2019-10-07 00:24:55,164 INFO L226 Difference]: Without dead ends: 181 [2019-10-07 00:24:55,170 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7221 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6553, Invalid=15797, Unknown=0, NotChecked=0, Total=22350 [2019-10-07 00:24:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-07 00:24:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 94. [2019-10-07 00:24:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-07 00:24:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-07 00:24:55,195 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 49 [2019-10-07 00:24:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:55,196 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-07 00:24:55,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-07 00:24:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-07 00:24:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 00:24:55,199 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:55,199 INFO L385 BasicCegarLoop]: trace histogram [51, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:55,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:55,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -768988135, now seen corresponding path program 5 times [2019-10-07 00:24:55,406 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:55,406 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:55,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:55,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-10-07 00:24:55,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:55,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:55,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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