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_minInArray_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:21,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:21,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:21,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:21,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:21,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:21,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:21,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:21,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:21,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:21,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:21,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:21,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:21,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:21,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:21,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:21,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:21,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:21,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:21,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:21,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:21,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:21,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:21,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:21,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:21,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:21,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:21,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:21,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:21,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:21,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:21,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:21,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:21,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:21,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:21,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:21,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:21,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:21,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:21,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:21,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:21,632 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-13 21:35:21,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:21,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:21,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:21,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:21,664 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:21,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:21,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:21,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:21,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:21,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:21,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:21,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:21,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:21,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:21,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:21,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:21,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:21,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:21,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:21,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:21,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:21,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:21,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:21,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:21,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:21,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:21,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:21,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:21,672 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-13 21:35:21,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:21,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:21,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:21,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:21,978 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:21,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-10-13 21:35:22,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa5d357d/8daef7fb6f6d4c68a1683fb5d4ddcb7e/FLAG3f22b9cff [2019-10-13 21:35:22,510 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:22,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-10-13 21:35:22,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa5d357d/8daef7fb6f6d4c68a1683fb5d4ddcb7e/FLAG3f22b9cff [2019-10-13 21:35:22,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa5d357d/8daef7fb6f6d4c68a1683fb5d4ddcb7e [2019-10-13 21:35:22,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:22,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:22,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:22,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:22,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:22,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:22" (1/1) ... [2019-10-13 21:35:22,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a118b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:22, skipping insertion in model container [2019-10-13 21:35:22,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:22" (1/1) ... [2019-10-13 21:35:22,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:22,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:23,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:23,122 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:23,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:23,174 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:23,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23 WrapperNode [2019-10-13 21:35:23,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:23,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:23,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:23,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:23,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (1/1) ... [2019-10-13 21:35:23,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:23,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:23,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:23,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:23,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (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-13 21:35:23,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:23,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:23,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:23,838 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:23,839 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:35:23,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:23 BoogieIcfgContainer [2019-10-13 21:35:23,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:23,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:23,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:23,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:23,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:22" (1/3) ... [2019-10-13 21:35:23,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f1985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:23, skipping insertion in model container [2019-10-13 21:35:23,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:23" (2/3) ... [2019-10-13 21:35:23,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f1985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:23, skipping insertion in model container [2019-10-13 21:35:23,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:23" (3/3) ... [2019-10-13 21:35:23,852 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-1.i [2019-10-13 21:35:23,866 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:23,875 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:23,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:23,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:23,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:23,915 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:23,915 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:23,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:23,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:23,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:23,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:35:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:23,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:23,943 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:23,945 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -493369724, now seen corresponding path program 1 times [2019-10-13 21:35:23,961 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:23,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215361429] [2019-10-13 21:35:23,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:23,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:23,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:24,146 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-13 21:35:24,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215361429] [2019-10-13 21:35:24,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:24,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:24,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547617990] [2019-10-13 21:35:24,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:24,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:24,172 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:35:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:24,211 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:35:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:35:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:24,223 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:35:24,224 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:35:24,228 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-13 21:35:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:35:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:35:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:35:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:35:24,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:35:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:24,268 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:35:24,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:35:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:35:24,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:24,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:24,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:24,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash 937030386, now seen corresponding path program 1 times [2019-10-13 21:35:24,272 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:24,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113320894] [2019-10-13 21:35:24,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:24,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:24,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:24,329 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-13 21:35:24,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113320894] [2019-10-13 21:35:24,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:24,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:24,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723669041] [2019-10-13 21:35:24,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:24,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:24,337 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:35:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:24,349 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-13 21:35:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:24,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:35:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:24,353 INFO L225 Difference]: With dead ends: 27 [2019-10-13 21:35:24,353 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:35:24,354 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-13 21:35:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:35:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:35:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:35:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:35:24,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:35:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:24,361 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:35:24,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:35:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:24,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:24,362 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:24,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 76469094, now seen corresponding path program 1 times [2019-10-13 21:35:24,363 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:24,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255357092] [2019-10-13 21:35:24,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:24,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:24,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:24,448 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-13 21:35:24,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255357092] [2019-10-13 21:35:24,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505471856] [2019-10-13 21:35:24,449 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-13 21:35:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:24,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:24,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:24,553 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-13 21:35:24,553 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:24,595 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-13 21:35:24,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542307303] [2019-10-13 21:35:24,622 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:24,622 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:24,629 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:24,637 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:24,638 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:24,835 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:25,135 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:25,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:25,177 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:25,177 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:25,179 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:25,179 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:25,179 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:25,180 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 110#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:25,183 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:25,183 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:25,184 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-13 21:35:25,184 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-13 21:35:25,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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-13 21:35:25,185 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:25,185 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:25,185 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:25,185 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:35:25,573 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:25,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:25,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572823456] [2019-10-13 21:35:25,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:25,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:25,577 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:35:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:26,143 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-13 21:35:26,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:35:26,144 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:35:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:26,147 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:35:26,148 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:35:26,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:35:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-13 21:35:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:35:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-13 21:35:26,179 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-13 21:35:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:26,180 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-13 21:35:26,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-13 21:35:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:35:26,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:26,182 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:26,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:26,387 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash 134362772, now seen corresponding path program 2 times [2019-10-13 21:35:26,389 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:26,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553209205] [2019-10-13 21:35:26,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:26,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:26,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:26,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553209205] [2019-10-13 21:35:26,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041075522] [2019-10-13 21:35:26,493 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 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-13 21:35:26,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:26,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:26,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:26,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:26,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:26,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181303584] [2019-10-13 21:35:26,606 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:26,606 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:26,607 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:26,607 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:26,607 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:26,667 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:26,816 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:26,840 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:26,847 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:26,847 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:26,848 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:26,848 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:26,849 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:26,849 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:26,849 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:26,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:26,850 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-13 21:35:26,850 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-13 21:35:26,850 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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-13 21:35:26,851 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:26,851 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:26,851 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:26,851 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:27,236 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:27,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 21:35:27,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548518148] [2019-10-13 21:35:27,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:35:27,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:27,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:35:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:35:27,242 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2019-10-13 21:35:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:27,964 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-10-13 21:35:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:35:27,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-10-13 21:35:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:27,966 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:35:27,966 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:35:27,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:35:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:35:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-13 21:35:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:35:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-13 21:35:27,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2019-10-13 21:35:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:27,978 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-13 21:35:27,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:35:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-13 21:35:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:35:27,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:27,979 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:28,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:28,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash 717812850, now seen corresponding path program 3 times [2019-10-13 21:35:28,185 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:28,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922723492] [2019-10-13 21:35:28,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:28,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:28,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:28,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922723492] [2019-10-13 21:35:28,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755640946] [2019-10-13 21:35:28,310 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 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-13 21:35:28,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:28,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:28,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:35:28,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:28,407 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:28,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [978511705] [2019-10-13 21:35:28,519 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:28,519 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:28,519 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:28,520 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:28,520 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:28,568 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:28,720 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:28,739 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:28,746 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:28,746 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:28,747 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:28,747 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:28,748 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:28,748 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 110#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:28,748 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:28,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:28,749 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-13 21:35:28,749 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-13 21:35:28,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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-13 21:35:28,750 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:28,750 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:28,750 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:28,750 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:29,045 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:29,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:35:29,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558002267] [2019-10-13 21:35:29,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:35:29,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:29,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:35:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:35:29,048 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 25 states. [2019-10-13 21:35:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:29,895 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-10-13 21:35:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:35:29,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-13 21:35:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:29,897 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:35:29,898 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:35:29,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:35:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:35:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-13 21:35:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:35:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:35:29,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-10-13 21:35:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:29,919 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:35:29,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:35:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:35:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:35:29,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:29,920 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:30,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:30,131 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1375752956, now seen corresponding path program 4 times [2019-10-13 21:35:30,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:30,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157247685] [2019-10-13 21:35:30,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:30,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:30,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:30,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157247685] [2019-10-13 21:35:30,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828669066] [2019-10-13 21:35:30,331 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 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-13 21:35:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:30,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:35:30,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:30,432 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:30,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [754220394] [2019-10-13 21:35:30,704 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:30,704 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:30,705 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:30,705 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:30,705 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:30,752 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:30,877 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:30,893 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:30,898 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:30,898 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:30,898 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:30,898 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:30,899 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:30,899 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 110#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:30,899 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:30,899 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:30,900 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-13 21:35:30,900 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-13 21:35:30,901 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:30,901 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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-13 21:35:30,904 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:30,904 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:30,904 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:31,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:31,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:35:31,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614223219] [2019-10-13 21:35:31,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:35:31,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:35:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:35:31,225 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-13 21:35:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:32,579 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2019-10-13 21:35:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:35:32,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-13 21:35:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:32,584 INFO L225 Difference]: With dead ends: 63 [2019-10-13 21:35:32,584 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:35:32,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:35:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:35:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-10-13 21:35:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:35:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-13 21:35:32,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2019-10-13 21:35:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:32,608 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-13 21:35:32,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:35:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-13 21:35:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 21:35:32,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:32,611 INFO L380 BasicCegarLoop]: trace histogram [26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:32,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:32,812 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -118694588, now seen corresponding path program 5 times [2019-10-13 21:35:32,813 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:32,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620432487] [2019-10-13 21:35:32,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:32,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:32,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:33,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620432487] [2019-10-13 21:35:33,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128640533] [2019-10-13 21:35:33,300 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 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-13 21:35:33,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:35:33,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:33,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:35:33,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:33,466 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:33,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1367993720] [2019-10-13 21:35:33,605 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:33,605 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:33,606 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:33,606 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:33,607 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:33,630 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:33,700 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:33,711 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:33,714 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:33,714 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:33,715 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:33,715 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:33,715 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:33,715 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 110#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:33,716 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:33,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:33,716 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-13 21:35:33,716 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:35:33,717 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:33,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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-13 21:35:33,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:33,717 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:33,717 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:34,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:34,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-13 21:35:34,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248134963] [2019-10-13 21:35:34,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-13 21:35:34,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-13 21:35:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:35:34,186 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 49 states. [2019-10-13 21:35:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:36,778 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-10-13 21:35:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:35:36,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 42 [2019-10-13 21:35:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:36,780 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:35:36,780 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 21:35:36,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-13 21:35:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 21:35:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-13 21:35:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 21:35:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-13 21:35:36,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2019-10-13 21:35:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:36,802 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-13 21:35:36,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-13 21:35:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-13 21:35:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:35:36,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:36,807 INFO L380 BasicCegarLoop]: trace histogram [27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:37,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:37,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 426553522, now seen corresponding path program 6 times [2019-10-13 21:35:37,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:37,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831771592] [2019-10-13 21:35:37,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:37,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:37,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:37,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831771592] [2019-10-13 21:35:37,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954749459] [2019-10-13 21:35:37,730 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 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-13 21:35:37,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:37,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:37,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:35:37,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:37,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:39,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [838175190] [2019-10-13 21:35:39,039 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:39,039 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:39,039 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:39,039 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:39,039 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:39,074 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:39,160 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:39,171 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:39,175 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:39,176 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:39,176 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:39,176 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:39,176 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:39,177 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:39,177 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:39,177 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:39,177 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-13 21:35:39,177 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-13 21:35:39,178 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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-13 21:35:39,178 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:39,178 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:39,178 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:39,178 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:39,570 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:39,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:35:39,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115952652] [2019-10-13 21:35:39,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:35:39,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:35:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:35:39,575 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 69 states. [2019-10-13 21:35:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:42,944 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-13 21:35:42,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-13 21:35:42,944 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 49 [2019-10-13 21:35:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:42,946 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:35:42,947 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 21:35:42,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-13 21:35:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 21:35:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-10-13 21:35:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-13 21:35:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-13 21:35:42,964 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 49 [2019-10-13 21:35:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:42,964 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-13 21:35:42,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:35:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-13 21:35:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:35:42,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:42,966 INFO L380 BasicCegarLoop]: trace histogram [56, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:43,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:43,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1211031940, now seen corresponding path program 7 times [2019-10-13 21:35:43,177 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:43,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493035206] [2019-10-13 21:35:43,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:44,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493035206] [2019-10-13 21:35:44,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585327736] [2019-10-13 21:35:44,906 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 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-13 21:35:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:45,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:35:45,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:45,089 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:49,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [828905183] [2019-10-13 21:35:49,093 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:49,093 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:49,094 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:49,094 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:49,094 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:49,116 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:49,185 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:49,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:49,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:49,203 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:49,203 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:49,203 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,204 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:49,204 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 110#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:49,204 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:49,204 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-13 21:35:49,205 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-13 21:35:49,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(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-13 21:35:49,205 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:49,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:49,205 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:49,205 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:35:49,765 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:49,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-13 21:35:49,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397209215] [2019-10-13 21:35:49,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-13 21:35:49,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-13 21:35:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-13 21:35:49,774 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 127 states. [2019-10-13 21:35:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:59,391 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2019-10-13 21:35:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-13 21:35:59,391 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 78 [2019-10-13 21:35:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:59,393 INFO L225 Difference]: With dead ends: 163 [2019-10-13 21:35:59,393 INFO L226 Difference]: Without dead ends: 143 [2019-10-13 21:35:59,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-13 21:35:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-13 21:35:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-10-13 21:35:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-13 21:35:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-13 21:35:59,418 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 78 [2019-10-13 21:35:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:59,418 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-13 21:35:59,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-13 21:35:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-13 21:35:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:35:59,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:59,423 INFO L380 BasicCegarLoop]: trace histogram [114, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:59,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:59,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2051514436, now seen corresponding path program 8 times [2019-10-13 21:35:59,630 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:59,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55035868] [2019-10-13 21:35:59,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:59,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:59,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat