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_compareModified_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:28:06,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:28:06,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:28:06,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:28:06,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:28:06,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:28:06,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:28:06,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:28:06,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:28:06,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:28:06,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:28:06,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:28:06,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:28:06,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:28:06,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:28:06,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:28:06,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:28:06,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:28:06,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:28:06,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:28:06,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:28:06,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:28:06,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:28:06,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:28:06,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:28:06,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:28:06,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:28:06,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:28:06,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:28:06,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:28:06,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:28:06,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:28:06,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:28:06,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:28:06,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:28:06,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:28:06,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:28:06,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:28:06,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:28:06,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:28:06,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:28:06,778 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-06 23:28:06,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:28:06,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:28:06,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:28:06,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:28:06,803 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:28:06,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:28:06,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:28:06,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:28:06,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:28:06,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:28:06,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:28:06,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:28:06,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:28:06,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:28:06,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:28:06,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:28:06,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:28:06,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:28:06,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:28:06,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:28:06,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:28:06,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:28:06,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:28:06,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:28:06,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:28:06,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:28:06,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:28:06,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:28:06,809 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-06 23:28:07,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:28:07,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:28:07,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:28:07,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:28:07,145 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:28:07,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compareModified_ground.i [2019-10-06 23:28:07,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa9e738c/d6c959d260574b94bd54d74ec5c815a0/FLAG4c6f5a314 [2019-10-06 23:28:07,638 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:28:07,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_ground.i [2019-10-06 23:28:07,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa9e738c/d6c959d260574b94bd54d74ec5c815a0/FLAG4c6f5a314 [2019-10-06 23:28:08,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa9e738c/d6c959d260574b94bd54d74ec5c815a0 [2019-10-06 23:28:08,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:28:08,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:28:08,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:28:08,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:28:08,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:28:08,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbaaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08, skipping insertion in model container [2019-10-06 23:28:08,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,076 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:28:08,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:28:08,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:28:08,306 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:28:08,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:28:08,424 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:28:08,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08 WrapperNode [2019-10-06 23:28:08,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:28:08,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:28:08,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:28:08,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:28:08,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (1/1) ... [2019-10-06 23:28:08,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:28:08,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:28:08,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:28:08,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:28:08,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (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-06 23:28:08,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:28:08,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:28:08,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:28:08,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:28:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:28:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:28:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:28:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:28:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:28:08,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:28:08,948 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-06 23:28:08,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:28:08 BoogieIcfgContainer [2019-10-06 23:28:08,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:28:08,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:28:08,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:28:08,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:28:08,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:28:08" (1/3) ... [2019-10-06 23:28:08,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8138846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:28:08, skipping insertion in model container [2019-10-06 23:28:08,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:28:08" (2/3) ... [2019-10-06 23:28:08,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8138846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:28:08, skipping insertion in model container [2019-10-06 23:28:08,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:28:08" (3/3) ... [2019-10-06 23:28:08,957 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2019-10-06 23:28:08,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:28:08,972 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:28:08,982 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:28:09,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:28:09,007 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:28:09,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:28:09,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:28:09,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:28:09,008 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:28:09,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:28:09,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:28:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-06 23:28:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:28:09,032 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:09,033 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:09,035 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1944584681, now seen corresponding path program 1 times [2019-10-06 23:28:09,047 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:09,047 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:09,201 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-06 23:28:09,202 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,203 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:28:09,203 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:28:09,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:28:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:28:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:28:09,225 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-06 23:28:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:09,263 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-10-06 23:28:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:28:09,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:28:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:09,275 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:28:09,276 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:28:09,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:28:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:28:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:28:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:28:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-06 23:28:09,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2019-10-06 23:28:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:09,319 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-06 23:28:09,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:28:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-10-06 23:28:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:28:09,321 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:09,321 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:09,321 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1263030727, now seen corresponding path program 1 times [2019-10-06 23:28:09,322 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:09,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:09,381 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-06 23:28:09,382 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,384 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:28:09,384 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:28:09,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:28:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:28:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:28:09,387 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-10-06 23:28:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:09,400 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-06 23:28:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:28:09,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:28:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:09,402 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:28:09,402 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:28:09,403 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:28:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:28:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-06 23:28:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:28:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-06 23:28:09,410 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2019-10-06 23:28:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:09,411 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-06 23:28:09,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:28:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-10-06 23:28:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:28:09,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:09,412 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:09,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:09,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash 404770879, now seen corresponding path program 1 times [2019-10-06 23:28:09,413 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:09,413 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:09,517 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-06 23:28:09,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:09,518 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:09,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:28:09,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:09,624 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-06 23:28:09,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:09,657 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-06 23:28:09,657 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:09,682 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:09,682 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:09,688 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:09,696 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:09,697 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:09,920 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:14,316 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-10-06 23:28:14,498 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:14,521 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:14,528 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:14,528 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 108#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:14,529 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 118#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:14,529 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 113#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:14,529 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 122#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:14,530 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 93#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:14,530 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 88#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:14,530 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 83#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:14,531 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-06 23:28:14,531 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-06 23:28:14,531 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 98#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:14,531 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 127#(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-06 23:28:14,531 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:14,532 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 103#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_5) v_prenex_4)))))) [2019-10-06 23:28:14,532 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 62#true [2019-10-06 23:28:14,891 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:14,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 19 [2019-10-06 23:28:14,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:28:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:28:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:28:14,894 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 19 states. [2019-10-06 23:28:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:15,681 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-06 23:28:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:28:15,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-06 23:28:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:15,683 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:28:15,683 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:28:15,684 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:28:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:28:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-06 23:28:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:28:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-06 23:28:15,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 15 [2019-10-06 23:28:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:15,695 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-06 23:28:15,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:28:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-06 23:28:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:28:15,696 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:15,696 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:15,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:15,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 251815191, now seen corresponding path program 2 times [2019-10-06 23:28:15,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:15,903 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:15,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:15,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:28:16,057 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:16,057 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:16,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:16,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:28:16,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:16,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:28:16,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:28:16,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:28:16,175 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:16,176 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:16,176 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:16,177 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:16,177 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:16,177 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:16,209 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:16,609 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:16,636 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:16,644 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:16,645 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:16,645 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:16,646 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:16,646 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:16,646 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:16,646 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:16,647 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:16,647 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:16,647 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-06 23:28:16,647 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-06 23:28:16,648 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:16,648 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-06 23:28:16,648 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:16,648 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) v_prenex_9) (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:28:16,648 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:16,991 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:16,991 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 12] total 20 [2019-10-06 23:28:16,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:28:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:28:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-10-06 23:28:16,993 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 20 states. [2019-10-06 23:28:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:17,723 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-10-06 23:28:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-06 23:28:17,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-10-06 23:28:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:17,724 INFO L225 Difference]: With dead ends: 60 [2019-10-06 23:28:17,725 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:28:17,726 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:28:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:28:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-06 23:28:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-06 23:28:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-06 23:28:17,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 19 [2019-10-06 23:28:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:17,734 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-06 23:28:17,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:28:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-06 23:28:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:28:17,735 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:17,735 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:17,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:17,939 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash 661658391, now seen corresponding path program 3 times [2019-10-06 23:28:17,940 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:17,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:17,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:17,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:28:18,127 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:18,128 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:18,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:18,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:28:18,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:18,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:28:18,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:28:18,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:28:18,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:18,294 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:18,294 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:18,294 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:18,294 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:18,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:18,335 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:18,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:18,759 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:18,764 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:18,765 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:18,765 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:18,765 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:18,766 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:18,766 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:18,767 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:18,767 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:18,767 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:18,767 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-06 23:28:18,768 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-06 23:28:18,768 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:18,768 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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-06 23:28:18,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:18,769 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((v_prenex_15 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_13) (select (select |#memory_int| v_prenex_15) v_prenex_14))))) [2019-10-06 23:28:18,769 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:19,291 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:19,291 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 12] total 30 [2019-10-06 23:28:19,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:28:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:28:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:28:19,294 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 30 states. [2019-10-06 23:28:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:20,445 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2019-10-06 23:28:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-06 23:28:20,445 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-10-06 23:28:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:20,447 INFO L225 Difference]: With dead ends: 74 [2019-10-06 23:28:20,447 INFO L226 Difference]: Without dead ends: 47 [2019-10-06 23:28:20,449 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=504, Invalid=2576, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:28:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-06 23:28:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-06 23:28:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:28:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-06 23:28:20,458 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2019-10-06 23:28:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:20,458 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-06 23:28:20,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:28:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-06 23:28:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:28:20,459 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:20,459 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:20,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:20,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1459515665, now seen corresponding path program 4 times [2019-10-06 23:28:20,664 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:20,665 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:20,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:20,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-06 23:28:20,831 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:20,831 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:20,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:20,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:28:20,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:28:21,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-06 23:28:21,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:21,306 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:21,306 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:21,307 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:21,307 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:21,307 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:21,337 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:21,670 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:21,681 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:21,686 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:21,686 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:21,687 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:21,687 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:21,687 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:21,687 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:21,687 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:21,688 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:21,688 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:21,688 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-06 23:28:21,688 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-06 23:28:21,688 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:21,689 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-06 23:28:21,689 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:21,689 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_20 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int) (v_prenex_19 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_20) v_prenex_19) (select (select |#memory_int| v_prenex_17) v_prenex_18))))) [2019-10-06 23:28:21,689 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:22,071 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:22,071 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 12] total 43 [2019-10-06 23:28:22,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-06 23:28:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-06 23:28:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2019-10-06 23:28:22,074 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 43 states. [2019-10-06 23:28:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:23,813 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2019-10-06 23:28:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-06 23:28:23,821 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 30 [2019-10-06 23:28:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:23,822 INFO L225 Difference]: With dead ends: 88 [2019-10-06 23:28:23,823 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:28:23,826 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1282, Invalid=5360, Unknown=0, NotChecked=0, Total=6642 [2019-10-06 23:28:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:28:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-06 23:28:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:28:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-06 23:28:23,841 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 30 [2019-10-06 23:28:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:23,841 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-06 23:28:23,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-06 23:28:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-06 23:28:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-06 23:28:23,845 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:23,845 INFO L385 BasicCegarLoop]: trace histogram [22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:24,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:24,049 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1397621737, now seen corresponding path program 5 times [2019-10-06 23:28:24,049 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:24,050 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:24,050 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:24,050 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:28:24,276 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:24,276 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:24,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:24,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:28:24,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:24,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:28:24,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:28:24,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:28:24,822 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:24,824 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:24,824 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:24,824 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:24,824 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:24,825 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:24,853 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:25,149 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:25,156 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:25,159 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:25,160 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:25,160 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:25,160 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:25,160 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:25,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:25,161 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:25,161 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:25,161 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:25,161 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-06 23:28:25,162 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-06 23:28:25,162 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:25,162 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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-06 23:28:25,162 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:25,162 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_25) v_prenex_24))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:28:25,163 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:25,542 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:25,542 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 12] total 32 [2019-10-06 23:28:25,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-06 23:28:25,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-06 23:28:25,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:28:25,545 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 32 states. [2019-10-06 23:28:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:26,685 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-10-06 23:28:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:28:26,686 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-10-06 23:28:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:26,688 INFO L225 Difference]: With dead ends: 90 [2019-10-06 23:28:26,688 INFO L226 Difference]: Without dead ends: 70 [2019-10-06 23:28:26,690 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:28:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-06 23:28:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-06 23:28:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-06 23:28:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-06 23:28:26,706 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 43 [2019-10-06 23:28:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:26,707 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-06 23:28:26,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-06 23:28:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-06 23:28:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:28:26,717 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:26,717 INFO L385 BasicCegarLoop]: trace histogram [22, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:26,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:26,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -858856681, now seen corresponding path program 6 times [2019-10-06 23:28:26,920 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:26,920 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:26,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:26,920 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:28:27,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:27,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:27,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:28:27,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:28:27,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:27,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:28:27,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-06 23:28:27,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-06 23:28:28,652 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:28,653 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:28,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:28,654 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:28,654 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:28,654 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:28,678 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:28,969 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:28,978 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:28,981 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:28,981 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:28,981 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:28,981 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:28,982 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:28,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:28,982 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:28,982 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:28,982 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:28,983 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-06 23:28:28,983 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-06 23:28:28,983 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:28,983 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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-06 23:28:28,983 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:28,984 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_29 Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_28 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_30) v_prenex_28) (select (select |#memory_int| v_prenex_29) v_prenex_27)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))))) [2019-10-06 23:28:28,984 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:29,504 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:29,505 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25, 12] total 78 [2019-10-06 23:28:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-06 23:28:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-06 23:28:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=4635, Unknown=0, NotChecked=0, Total=6006 [2019-10-06 23:28:29,509 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 78 states. [2019-10-06 23:28:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:33,446 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2019-10-06 23:28:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-06 23:28:33,447 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 53 [2019-10-06 23:28:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:33,449 INFO L225 Difference]: With dead ends: 134 [2019-10-06 23:28:33,449 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:28:33,456 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5653 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5088, Invalid=17864, Unknown=0, NotChecked=0, Total=22952 [2019-10-06 23:28:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:28:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-10-06 23:28:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-06 23:28:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-10-06 23:28:33,467 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 53 [2019-10-06 23:28:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-10-06 23:28:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-06 23:28:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-10-06 23:28:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-06 23:28:33,469 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:33,470 INFO L385 BasicCegarLoop]: trace histogram [46, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:33,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:33,672 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2083364625, now seen corresponding path program 7 times [2019-10-06 23:28:33,673 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:33,673 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:33,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:33,674 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:28:34,336 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:34,336 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:34,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-06 23:28:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:34,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:28:34,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-06 23:28:35,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-06 23:28:38,483 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:38,485 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:28:38,485 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:38,485 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:38,485 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:38,486 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:38,511 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:38,782 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:28:38,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:38,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:38,794 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:38,794 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 116#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:38,794 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 126#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:38,794 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 121#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:38,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 130#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:38,795 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 101#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:38,795 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 96#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:28:38,795 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 91#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:28:38,795 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-06 23:28:38,795 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-06 23:28:38,796 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 106#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:38,796 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 135#(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-06 23:28:38,796 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:38,796 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 111#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int) (v_prenex_32 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_34) v_prenex_32) (select (select |#memory_int| v_prenex_35) v_prenex_33)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:28:38,796 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:28:39,418 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:39,419 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 49, 49, 12] total 127 [2019-10-06 23:28:39,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:28:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:28:39,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4824, Invalid=11178, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:28:39,426 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 127 states. [2019-10-06 23:28:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:48,530 INFO L93 Difference]: Finished difference Result 184 states and 243 transitions. [2019-10-06 23:28:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-06 23:28:48,531 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 78 [2019-10-06 23:28:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:48,533 INFO L225 Difference]: With dead ends: 184 [2019-10-06 23:28:48,533 INFO L226 Difference]: Without dead ends: 144 [2019-10-06 23:28:48,537 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13982 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=16504, Invalid=45746, Unknown=0, NotChecked=0, Total=62250 [2019-10-06 23:28:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-06 23:28:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-10-06 23:28:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-06 23:28:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2019-10-06 23:28:48,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 78 [2019-10-06 23:28:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:48,553 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2019-10-06 23:28:48,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:28:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2019-10-06 23:28:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-06 23:28:48,555 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:48,555 INFO L385 BasicCegarLoop]: trace histogram [94, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:48,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:48,757 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 744568343, now seen corresponding path program 8 times [2019-10-06 23:28:48,758 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:48,758 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:48,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:48,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4675 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:28:49,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:49,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:49,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:08,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-06 23:30:08,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:08,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-06 23:30:08,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4675 backedges. 94 proven. 210 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-10-06 23:30:08,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4675 backedges. 0 proven. 580 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-10-06 23:30:09,600 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:09,601 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:09,602 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:09,602 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:09,602 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:09,602 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:09,622 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:09,904 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:09,910 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:09,913 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:09,914 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:09,914 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_40) (select (select |#memory_int| v_prenex_39) v_prenex_37))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:09,914 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_40) (select (select |#memory_int| v_prenex_39) v_prenex_37))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:09,914 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_40) (select (select |#memory_int| v_prenex_39) v_prenex_37))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:09,914 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:09,915 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:09,915 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:30:09,915 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:30:09,915 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-06 23:30:09,916 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-06 23:30:09,916 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:09,916 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-06 23:30:09,916 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:09,916 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_38) v_prenex_40) (select (select |#memory_int| v_prenex_39) v_prenex_37))))) [2019-10-06 23:30:09,916 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:30:10,338 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:10,338 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 27, 12] total 61 [2019-10-06 23:30:10,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:30:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:30:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=2476, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:30:10,342 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand 61 states. [2019-10-06 23:30:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:12,943 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2019-10-06 23:30:12,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-06 23:30:12,943 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 127 [2019-10-06 23:30:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:12,945 INFO L225 Difference]: With dead ends: 186 [2019-10-06 23:30:12,945 INFO L226 Difference]: Without dead ends: 166 [2019-10-06 23:30:12,947 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2938 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3436, Invalid=8996, Unknown=0, NotChecked=0, Total=12432 [2019-10-06 23:30:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-06 23:30:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2019-10-06 23:30:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-06 23:30:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 169 transitions. [2019-10-06 23:30:12,962 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 169 transitions. Word has length 127 [2019-10-06 23:30:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:12,963 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 169 transitions. [2019-10-06 23:30:12,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:30:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 169 transitions. [2019-10-06 23:30:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-06 23:30:12,965 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:12,965 INFO L385 BasicCegarLoop]: trace histogram [94, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:13,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:13,166 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1888599831, now seen corresponding path program 9 times [2019-10-06 23:30:13,167 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:13,167 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:13,167 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:13,167 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5368 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:30:14,839 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:14,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:14,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:15,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:15,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:15,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-06 23:30:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5368 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-06 23:30:19,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5368 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-06 23:30:31,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:31,210 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:31,211 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:31,211 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:31,211 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:31,211 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:31,231 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:31,527 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:31,535 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:31,537 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:31,538 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:31,538 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (exists ((v_prenex_45 Int) (v_prenex_44 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_43 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (v_prenex_42 Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_43) v_prenex_44) (select (select |#memory_int| v_prenex_42) v_prenex_45))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,538 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((v_prenex_45 Int) (v_prenex_44 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_43 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (v_prenex_42 Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_43) v_prenex_44) (select (select |#memory_int| v_prenex_42) v_prenex_45))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,538 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (exists ((v_prenex_45 Int) (v_prenex_44 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_43 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (v_prenex_42 Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_43) v_prenex_44) (select (select |#memory_int| v_prenex_42) v_prenex_45))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,538 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:31,539 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,539 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:30:31,539 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:30:31,539 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-06 23:30:31,539 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-06 23:30:31,539 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-06 23:30:31,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:31,540 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((v_prenex_45 Int) (v_prenex_44 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_43 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (v_prenex_42 Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_43) v_prenex_44) (select (select |#memory_int| v_prenex_42) v_prenex_45))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))))) [2019-10-06 23:30:31,540 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:30:32,676 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:32,676 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 97, 97, 12] total 246 [2019-10-06 23:30:32,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 246 states [2019-10-06 23:30:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2019-10-06 23:30:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19359, Invalid=40911, Unknown=0, NotChecked=0, Total=60270 [2019-10-06 23:30:32,684 INFO L87 Difference]: Start difference. First operand 163 states and 169 transitions. Second operand 246 states. [2019-10-06 23:31:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:03,885 INFO L93 Difference]: Finished difference Result 326 states and 433 transitions. [2019-10-06 23:31:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-10-06 23:31:03,886 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 149 [2019-10-06 23:31:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:03,888 INFO L225 Difference]: With dead ends: 326 [2019-10-06 23:31:03,888 INFO L226 Difference]: Without dead ends: 263 [2019-10-06 23:31:03,897 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51133 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=66564, Invalid=171092, Unknown=0, NotChecked=0, Total=237656 [2019-10-06 23:31:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-06 23:31:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2019-10-06 23:31:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-06 23:31:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 266 transitions. [2019-10-06 23:31:03,919 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 266 transitions. Word has length 149 [2019-10-06 23:31:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:03,919 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 266 transitions. [2019-10-06 23:31:03,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 246 states. [2019-10-06 23:31:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 266 transitions. [2019-10-06 23:31:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-06 23:31:03,923 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:03,923 INFO L385 BasicCegarLoop]: trace histogram [190, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:04,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:04,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -72454929, now seen corresponding path program 10 times [2019-10-06 23:31:04,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:04,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:04,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:04,129 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19091 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2019-10-06 23:31:07,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:07,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:07,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:07,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-06 23:31:07,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19091 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-06 23:31:23,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19091 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-06 23:32:07,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:07,029 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:32:07,029 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:07,029 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:07,029 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:07,029 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:07,060 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:07,366 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:07,374 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:07,376 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:07,376 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:07,376 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_49 Int) (v_prenex_48 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_47 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_50 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_49) v_prenex_48) (select (select |#memory_int| v_prenex_50) v_prenex_47)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:07,376 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_47 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_50 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_49) v_prenex_48) (select (select |#memory_int| v_prenex_50) v_prenex_47)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_49 Int) (v_prenex_48 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_47 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_50 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_49) v_prenex_48) (select (select |#memory_int| v_prenex_50) v_prenex_47)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 103#(and (= main_~x~0 0) (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 98#(and (not (< main_~j~0 100000)) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) [2019-10-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location L17-1 satisfy 93#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-06 23:32:07,377 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-06 23:32:07,377 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-06 23:32:07,377 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 108#(and (< main_~x~0 100000) (= main_~x~0 0) (not (< main_~j~0 100000)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:07,378 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-06 23:32:07,378 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:07,378 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((v_prenex_49 Int) (v_prenex_48 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_47 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (v_prenex_50 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_49) v_prenex_48) (select (select |#memory_int| v_prenex_50) v_prenex_47)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) [2019-10-06 23:32:07,378 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:32:09,030 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:09,031 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 193, 193, 12] total 439 [2019-10-06 23:32:09,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 439 states [2019-10-06 23:32:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 439 interpolants. [2019-10-06 23:32:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74604, Invalid=117678, Unknown=0, NotChecked=0, Total=192282 [2019-10-06 23:32:09,046 INFO L87 Difference]: Start difference. First operand 260 states and 266 transitions. Second operand 439 states. [2019-10-06 23:33:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:54,810 INFO L93 Difference]: Finished difference Result 520 states and 723 transitions. [2019-10-06 23:33:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 440 states. [2019-10-06 23:33:54,810 INFO L78 Accepts]: Start accepts. Automaton has 439 states. Word has length 246 [2019-10-06 23:33:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:54,814 INFO L225 Difference]: With dead ends: 520 [2019-10-06 23:33:54,814 INFO L226 Difference]: Without dead ends: 456 [2019-10-06 23:33:54,838 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 872 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147722 ImplicationChecksByTransitivity, 157.0s TimeCoverageRelationStatistics Valid=241132, Invalid=521870, Unknown=0, NotChecked=0, Total=763002 [2019-10-06 23:33:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-06 23:33:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 453. [2019-10-06 23:33:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-10-06 23:33:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 459 transitions. [2019-10-06 23:33:54,864 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 459 transitions. Word has length 246 [2019-10-06 23:33:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:54,865 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 459 transitions. [2019-10-06 23:33:54,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 439 states. [2019-10-06 23:33:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 459 transitions. [2019-10-06 23:33:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-10-06 23:33:54,873 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:54,874 INFO L385 BasicCegarLoop]: trace histogram [382, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:55,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:55,080 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1260509719, now seen corresponding path program 11 times [2019-10-06 23:33:55,081 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:55,081 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:55,081 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:55,081 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:34:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 74143 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 73153 trivial. 0 not checked. [2019-10-06 23:34:07,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:07,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:34:07,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true