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_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:06,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:06,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:06,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:06,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:06,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:06,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:06,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:06,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:06,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:06,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:06,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:06,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:06,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:06,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:06,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:06,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:06,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:06,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:06,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:06,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:06,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:06,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:06,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:06,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:06,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:06,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:06,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:06,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:06,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:06,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:06,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:06,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:06,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:06,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:06,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:06,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:06,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:06,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:06,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:06,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:06,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:36:06,598 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:06,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:06,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:06,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:06,601 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:06,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:06,601 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:06,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:06,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:06,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:06,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:06,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:06,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:06,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:06,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:06,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:06,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:06,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:06,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:06,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:06,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:06,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:06,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:06,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:06,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:06,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:06,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:06,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:06,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:36:06,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:06,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:06,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:06,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:06,913 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:06,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2019-10-13 21:36:06,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc977773/a3f3aae2e7e84c03a191a35e5ff57f84/FLAG6c2c30bce [2019-10-13 21:36:07,500 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:07,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2019-10-13 21:36:07,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc977773/a3f3aae2e7e84c03a191a35e5ff57f84/FLAG6c2c30bce [2019-10-13 21:36:07,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc977773/a3f3aae2e7e84c03a191a35e5ff57f84 [2019-10-13 21:36:07,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:07,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:07,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:07,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:07,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:07,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:07" (1/1) ... [2019-10-13 21:36:07,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3fa134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:07, skipping insertion in model container [2019-10-13 21:36:07,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:07" (1/1) ... [2019-10-13 21:36:07,843 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:07,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:08,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:08,047 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:08,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:08,094 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:08,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08 WrapperNode [2019-10-13 21:36:08,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:08,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:08,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:08,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:08,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (1/1) ... [2019-10-13 21:36:08,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:08,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:08,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:08,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:08,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36: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-13 21:36:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:08,560 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:08,561 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:08,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:08 BoogieIcfgContainer [2019-10-13 21:36:08,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:08,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:08,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:08,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:08,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:07" (1/3) ... [2019-10-13 21:36:08,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd8582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:08, skipping insertion in model container [2019-10-13 21:36:08,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:08" (2/3) ... [2019-10-13 21:36:08,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd8582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:08, skipping insertion in model container [2019-10-13 21:36:08,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:08" (3/3) ... [2019-10-13 21:36:08,574 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_ground-1.i [2019-10-13 21:36:08,588 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:08,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:08,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:08,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:08,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:08,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:08,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:08,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:08,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:08,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:08,642 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:36:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:08,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:08,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:08,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -397145490, now seen corresponding path program 1 times [2019-10-13 21:36:08,695 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:08,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773340681] [2019-10-13 21:36:08,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:08,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:08,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:36:08,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773340681] [2019-10-13 21:36:08,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:08,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:36:08,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023508424] [2019-10-13 21:36:08,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:36:08,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:36:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:36:08,857 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-13 21:36:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:08,880 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-13 21:36:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:36:08,882 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 21:36:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:08,891 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:36:08,891 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:36:08,895 INFO L600 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-13 21:36:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:36:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:36:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:08,937 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:08,938 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:08,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:36:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:08,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:08,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:08,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1334096934, now seen corresponding path program 1 times [2019-10-13 21:36:08,941 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:08,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433596708] [2019-10-13 21:36:08,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:08,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:36:09,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433596708] [2019-10-13 21:36:09,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:09,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:09,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809693046] [2019-10-13 21:36:09,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:09,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:09,025 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-13 21:36:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:09,048 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-13 21:36:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:09,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:36:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:09,052 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:36:09,052 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:36:09,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:36:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:36:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:36:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-13 21:36:09,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-13 21:36:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:09,065 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-13 21:36:09,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-13 21:36:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:36:09,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:09,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:09,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 980330470, now seen corresponding path program 1 times [2019-10-13 21:36:09,070 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:09,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581573394] [2019-10-13 21:36:09,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:09,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:36:09,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581573394] [2019-10-13 21:36:09,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:09,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:36:09,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193492767] [2019-10-13 21:36:09,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:36:09,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:09,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:36:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:36:09,184 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-10-13 21:36:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:09,226 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-13 21:36:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:36:09,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:36:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:09,232 INFO L225 Difference]: With dead ends: 32 [2019-10-13 21:36:09,232 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:36:09,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:36:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:36:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:36:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:36:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-13 21:36:09,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-10-13 21:36:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:09,242 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-13 21:36:09,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:36:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-13 21:36:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:36:09,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:09,245 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:09,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1869599928, now seen corresponding path program 1 times [2019-10-13 21:36:09,247 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:09,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480457636] [2019-10-13 21:36:09,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:09,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:09,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:09,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480457636] [2019-10-13 21:36:09,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839456698] [2019-10-13 21:36:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:09,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:09,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:09,461 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:09,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092180826] [2019-10-13 21:36:09,545 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:36:09,546 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:09,555 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:09,564 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:09,564 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:09,729 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:10,189 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:36:10,215 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:10,229 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:10,229 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:10,231 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 132#(and (or (= (select (select |#memory_int| |main_~#dst~0.base|) (+ (* main_~i~0 4) |main_~#dst~0.offset| (- 4))) (select (select |#memory_int| |main_~#src~0.base|) (+ (* main_~i~0 4) |main_~#src~0.offset| (- 4)))) (not (< main_~j~0 100000))) (<= 100000 main_~j~0)) [2019-10-13 21:36:10,232 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 146#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|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| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (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|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:10,232 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|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| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (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|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:10,232 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:10,233 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 111#(<= 100000 main_~j~0) [2019-10-13 21:36:10,233 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 141#(and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|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| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (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|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:10,234 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:10,234 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:10,235 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:10,235 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 121#(and (= main_~x~0 0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:10,236 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:10,236 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:10,236 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|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| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (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|)))))) [2019-10-13 21:36:10,236 INFO L193 IcfgInterpreter]: Reachable states at location L15-5 satisfy 116#(<= 100000 main_~j~0) [2019-10-13 21:36:10,237 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 126#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* main_~x~0 4) |main_~#src~0.offset|)) |main_#t~mem6|) (= |main_#t~mem5| (select (select |#memory_int| |main_~#dst~0.base|) (+ (* main_~x~0 4) |main_~#dst~0.offset|))) (= main_~x~0 0) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:10,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:10,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:36:10,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591566787] [2019-10-13 21:36:10,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:36:10,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:36:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:36:10,656 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 17 states. [2019-10-13 21:36:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:11,270 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-10-13 21:36:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:36:11,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-10-13 21:36:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:11,272 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:36:11,272 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:36:11,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:36:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:36:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-10-13 21:36:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:11,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-13 21:36:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:11,287 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:11,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:36:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:11,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:11,289 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:11,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:11,503 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 407056044, now seen corresponding path program 2 times [2019-10-13 21:36:11,505 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:11,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054103967] [2019-10-13 21:36:11,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:11,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:11,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:11,606 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-13 21:36:11,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054103967] [2019-10-13 21:36:11,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901124346] [2019-10-13 21:36:11,607 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:11,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:36:11,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:11,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 21:36:11,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:36:11,816 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:12,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:12,102 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:335) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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-13 21:36:12,106 INFO L168 Benchmark]: Toolchain (without parser) took 4281.21 ms. Allocated memory was 138.9 MB in the beginning and 243.8 MB in the end (delta: 104.9 MB). Free memory was 104.4 MB in the beginning and 159.1 MB in the end (delta: -54.7 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:36:12,107 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 21:36:12,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.30 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 93.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:36:12,109 INFO L168 Benchmark]: Boogie Preprocessor took 120.05 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.6 MB in the beginning and 180.6 MB in the end (delta: -87.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:36:12,109 INFO L168 Benchmark]: RCFGBuilder took 347.28 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 162.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:36:12,111 INFO L168 Benchmark]: TraceAbstraction took 3540.84 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 161.5 MB in the beginning and 159.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:36:12,115 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.30 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 93.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.05 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.6 MB in the beginning and 180.6 MB in the end (delta: -87.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.28 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 162.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3540.84 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 161.5 MB in the beginning and 159.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 43.3 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...