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_strcpy_original-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:24:27,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:24:27,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:24:27,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:24:27,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:24:27,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:24:27,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:24:27,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:24:27,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:24:27,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:24:27,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:24:27,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:24:27,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:24:27,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:24:27,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:24:27,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:24:27,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:24:27,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:24:27,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:24:27,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:24:27,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:24:27,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:24:27,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:24:27,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:24:27,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:24:27,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:24:27,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:24:27,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:24:27,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:24:27,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:24:27,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:24:27,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:24:27,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:24:27,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:24:27,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:24:27,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:24:27,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:24:27,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:24:27,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:24:27,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:24:27,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:24:27,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:24:27,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:24:27,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:24:27,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:24:27,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:24:27,259 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:24:27,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:24:27,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:24:27,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:24:27,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:24:27,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:24:27,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:24:27,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:24:27,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:24:27,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:24:27,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:24:27,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:24:27,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:24:27,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:24:27,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:24:27,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:24:27,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:24:27,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:27,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:24:27,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:24:27,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:24:27,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:24:27,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:24:27,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:24:27,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:24:27,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:24:27,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:24:27,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:24:27,563 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:24:27,564 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:24:27,565 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-10-07 00:24:27,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a2204e0/0c7076809b254f3a93c7ab559aae51a1/FLAGdde24b801 [2019-10-07 00:24:28,086 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:24:28,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_original-2.i [2019-10-07 00:24:28,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a2204e0/0c7076809b254f3a93c7ab559aae51a1/FLAGdde24b801 [2019-10-07 00:24:28,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97a2204e0/0c7076809b254f3a93c7ab559aae51a1 [2019-10-07 00:24:28,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:24:28,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:24:28,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:28,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:24:28,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:24:28,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af509e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28, skipping insertion in model container [2019-10-07 00:24:28,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,513 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:24:28,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:24:28,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:28,781 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:24:28,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:28,916 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:24:28,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28 WrapperNode [2019-10-07 00:24:28,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:28,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:24:28,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:24:28,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:24:28,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... [2019-10-07 00:24:28,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:24:28,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:24:28,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:24:28,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:24:28,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:29,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:24:29,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:24:29,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:24:29,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:24:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:24:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:24:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:24:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:24:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:24:29,405 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:24:29,405 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:24:29,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:29 BoogieIcfgContainer [2019-10-07 00:24:29,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:24:29,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:24:29,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:24:29,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:24:29,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:24:28" (1/3) ... [2019-10-07 00:24:29,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b9e757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:29, skipping insertion in model container [2019-10-07 00:24:29,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:28" (2/3) ... [2019-10-07 00:24:29,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b9e757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:29, skipping insertion in model container [2019-10-07 00:24:29,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:29" (3/3) ... [2019-10-07 00:24:29,415 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original-2.i [2019-10-07 00:24:29,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:24:29,441 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:24:29,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:24:29,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:24:29,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:24:29,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:24:29,479 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:24:29,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:24:29,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:24:29,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:24:29,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:24:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-07 00:24:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:24:29,499 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:29,500 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:29,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -774447507, now seen corresponding path program 1 times [2019-10-07 00:24:29,515 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:29,515 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:29,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,516 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:29,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:29,653 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:29,654 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 00:24:29,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 00:24:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 00:24:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:24:29,676 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-10-07 00:24:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:29,714 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2019-10-07 00:24:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 00:24:29,716 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-07 00:24:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:29,727 INFO L225 Difference]: With dead ends: 38 [2019-10-07 00:24:29,727 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:24:29,735 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:24:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:24:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 00:24:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:24:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-07 00:24:29,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-07 00:24:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:29,797 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-07 00:24:29,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 00:24:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-07 00:24:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:24:29,799 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:29,800 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:29,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:29,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1909411100, now seen corresponding path program 1 times [2019-10-07 00:24:29,802 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:29,802 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:29,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,802 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:29,933 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:29,933 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:29,934 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:29,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:29,937 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-10-07 00:24:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:29,951 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-07 00:24:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:29,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-07 00:24:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:29,954 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:24:29,954 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 00:24:29,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 00:24:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 00:24:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:24:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-07 00:24:29,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-10-07 00:24:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:29,962 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-07 00:24:29,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-07 00:24:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 00:24:29,964 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:29,964 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:29,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1099482512, now seen corresponding path program 1 times [2019-10-07 00:24:29,965 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:29,965 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:29,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,966 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:30,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:30,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:30,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:30,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:30,216 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:30,247 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:24:30,247 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:30,257 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:30,264 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:30,264 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:30,481 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:30,752 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 22 for LOIs [2019-10-07 00:24:30,793 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:30,811 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:30,812 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:30,812 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 73#(and (not (< main_~j~0 100000)) (<= 100000 main_~j~0)) [2019-10-07 00:24:30,813 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:30,813 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 81#(<= 100000 main_~j~0) [2019-10-07 00:24:30,813 INFO L193 IcfgInterpreter]: Reachable states at location L5-1 satisfy 119#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:30,813 INFO L193 IcfgInterpreter]: Reachable states at location L20-5 satisfy 91#(and (<= 0 main_~i~0) (not (< main_~j~0 100000)) (<= 100000 main_~j~0) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 00:24:30,814 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:30,814 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:30,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:30,814 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 99#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 00:24:30,815 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:30,815 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:30,815 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 114#(and (exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:30,816 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(exists ((|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|))) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) 0))))) [2019-10-07 00:24:30,816 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 68#true [2019-10-07 00:24:30,817 INFO L193 IcfgInterpreter]: Reachable states at location L15-5 satisfy 86#(and (or (and (not (< main_~j~0 100000)) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset|)) 0))) (or (and (<= main_~i~0 100000) (<= 100000 main_~j~0)) (and (<= 100000 main_~i~0) (<= 100000 main_~j~0)))) [2019-10-07 00:24:30,818 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 104#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 main_~i~0) |main_~#dst~0.offset|))) (< main_~i~0 100000) (<= 0 main_~i~0) (not (< main_~j~0 100000)) (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset|)) |main_#t~mem7|) (<= 100000 main_~j~0) (<= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset|)) 0)) (= main_~i~0 0)) [2019-10-07 00:24:31,283 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:31,283 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-07 00:24:31,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:24:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:24:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:24:31,288 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 18 states. [2019-10-07 00:24:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:31,903 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-10-07 00:24:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 00:24:31,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-07 00:24:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:31,905 INFO L225 Difference]: With dead ends: 46 [2019-10-07 00:24:31,905 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 00:24:31,907 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-10-07 00:24:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 00:24:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2019-10-07 00:24:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 00:24:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-07 00:24:31,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-10-07 00:24:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:31,916 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-07 00:24:31,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:24:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-07 00:24:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 00:24:31,917 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:31,917 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:32,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:32,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1352911388, now seen corresponding path program 2 times [2019-10-07 00:24:32,125 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:32,125 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:32,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:32,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:32,217 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:32,217 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:32,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:32,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-07 00:24:32,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:32,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:24:32,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:24:32,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:24:32,489 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:24:32,489 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 16 [2019-10-07 00:24:32,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 00:24:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 00:24:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-07 00:24:32,491 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-10-07 00:24:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:32,615 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-07 00:24:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:24:32,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-07 00:24:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:32,618 INFO L225 Difference]: With dead ends: 42 [2019-10-07 00:24:32,619 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 00:24:32,619 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:24:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 00:24:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-10-07 00:24:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:24:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 00:24:32,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2019-10-07 00:24:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:32,631 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 00:24:32,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 00:24:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 00:24:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:24:32,632 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:32,632 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:32,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:32,834 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1203464079, now seen corresponding path program 1 times [2019-10-07 00:24:32,835 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:32,835 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:32,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:32,836 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:32,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:32,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:32,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:24:32,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:33,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:33,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:33,087 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 00:24:33,088 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:33,088 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:33,088 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:33,089 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:33,120 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:33,401 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 22 for LOIs [2019-10-07 00:24:33,435 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:33,448 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:33,448 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:33,449 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 140#(and (or (not (< main_~j~0 100000)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 main_~i~0) |main_~#dst~0.offset| (- 4))) (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset| (- 4))))) (<= 100000 main_~j~0)) [2019-10-07 00:24:33,449 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 163#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:33,451 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 111#(<= 100000 main_~j~0) [2019-10-07 00:24:33,451 INFO L193 IcfgInterpreter]: Reachable states at location L5-1 satisfy 154#(and (exists ((|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~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-07 00:24:33,452 INFO L193 IcfgInterpreter]: Reachable states at location L20-5 satisfy 121#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 00:24:33,453 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:33,454 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:33,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 168#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:33,455 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 129#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 00:24:33,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:33,457 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 159#(and (exists ((|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~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-07 00:24:33,457 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 149#(and (exists ((|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:33,458 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 144#(exists ((|v_main_~#dst~0.base_BEFORE_CALL_2| Int) (|v_main_~#dst~0.offset_BEFORE_CALL_2| Int) (|v_main_~#src~0.base_BEFORE_CALL_2| Int) (|v_main_~#src~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) 0)) (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_2|) |v_main_~#src~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_2|) |v_main_~#dst~0.offset_BEFORE_CALL_2|))))) [2019-10-07 00:24:33,458 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 68#true [2019-10-07 00:24:33,459 INFO L193 IcfgInterpreter]: Reachable states at location L15-5 satisfy 116#(<= 100000 main_~j~0) [2019-10-07 00:24:33,459 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 134#(and (= |main_#t~mem6| (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 main_~i~0) |main_~#dst~0.offset|))) (< main_~i~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset|)) |main_#t~mem7|) (<= 100000 main_~j~0) (<= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset|)) 0)) (= main_~i~0 0)) [2019-10-07 00:24:33,763 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:33,763 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-07 00:24:33,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:24:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:24:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:24:33,766 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 23 states. [2019-10-07 00:24:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:34,486 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-10-07 00:24:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:24:34,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-10-07 00:24:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:34,488 INFO L225 Difference]: With dead ends: 56 [2019-10-07 00:24:34,489 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 00:24:34,490 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 00:24:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 00:24:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-10-07 00:24:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 00:24:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-07 00:24:34,498 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2019-10-07 00:24:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:34,499 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-07 00:24:34,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:24:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-07 00:24:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 00:24:34,500 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:34,500 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:34,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:34,704 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 520950543, now seen corresponding path program 2 times [2019-10-07 00:24:34,705 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:34,705 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:34,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:34,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:34,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:34,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:34,878 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:34,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:24:34,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:34,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 00:24:34,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:24:35,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:35,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:35,394 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 00:24:35,399 INFO L168 Benchmark]: Toolchain (without parser) took 6904.23 ms. Allocated memory was 143.1 MB in the beginning and 275.8 MB in the end (delta: 132.6 MB). Free memory was 102.2 MB in the beginning and 151.9 MB in the end (delta: -49.7 MB). Peak memory consumption was 83.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,406 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.34 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 102.0 MB in the beginning and 183.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,413 INFO L168 Benchmark]: Boogie Preprocessor took 46.90 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 180.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,413 INFO L168 Benchmark]: RCFGBuilder took 441.94 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 161.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,414 INFO L168 Benchmark]: TraceAbstraction took 5989.28 ms. Allocated memory was 203.9 MB in the beginning and 275.8 MB in the end (delta: 71.8 MB). Free memory was 161.9 MB in the beginning and 151.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:35,420 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 143.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 421.34 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 102.0 MB in the beginning and 183.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.90 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 180.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.94 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 161.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5989.28 ms. Allocated memory was 203.9 MB in the beginning and 275.8 MB in the end (delta: 71.8 MB). Free memory was 161.9 MB in the beginning and 151.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...