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_copy5_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:29,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:29,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:29,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:29,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:29,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:29,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:29,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:29,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:29,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:29,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:29,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:29,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:29,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:29,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:29,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:29,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:29,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:29,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:29,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:29,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:29,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:29,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:29,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:29,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:29,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:29,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:29,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:29,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:29,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:29,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:29,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:29,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:29,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:29,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:29,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:29,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:29,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:29,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:29,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:29,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:29,972 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:33:29,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:29,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:29,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:29,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:29,989 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:29,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:29,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:29,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:29,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:29,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:29,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:29,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:29,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:29,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:29,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:29,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:29,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:29,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:29,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:29,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:29,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:29,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:29,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:29,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:29,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:29,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:29,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:29,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:29,994 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:33:30,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:30,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:30,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:30,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:30,300 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:30,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_ground-1.i [2019-10-13 21:33:30,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092af665e/e6307ea3d6bb4898a56af98be392b8e1/FLAG16c55d425 [2019-10-13 21:33:30,857 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:30,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_ground-1.i [2019-10-13 21:33:30,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092af665e/e6307ea3d6bb4898a56af98be392b8e1/FLAG16c55d425 [2019-10-13 21:33:31,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092af665e/e6307ea3d6bb4898a56af98be392b8e1 [2019-10-13 21:33:31,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:31,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:31,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:31,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:31,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:31,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5171f16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31, skipping insertion in model container [2019-10-13 21:33:31,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,324 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:31,342 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:31,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:31,524 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:31,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:31,569 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:31,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31 WrapperNode [2019-10-13 21:33:31,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:31,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:31,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:31,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:31,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (1/1) ... [2019-10-13 21:33:31,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:31,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:31,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:31,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:31,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (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:33:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:32,261 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:32,262 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-13 21:33:32,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32 BoogieIcfgContainer [2019-10-13 21:33:32,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:32,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:32,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:32,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:32,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:31" (1/3) ... [2019-10-13 21:33:32,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:31" (2/3) ... [2019-10-13 21:33:32,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:32, skipping insertion in model container [2019-10-13 21:33:32,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:32" (3/3) ... [2019-10-13 21:33:32,271 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy5_ground-1.i [2019-10-13 21:33:32,281 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:32,289 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:32,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:32,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:32,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:32,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:32,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:32,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:32,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:32,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:32,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 21:33:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:32,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,351 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -324339811, now seen corresponding path program 1 times [2019-10-13 21:33:32,368 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431811167] [2019-10-13 21:33:32,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,534 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:33:32,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431811167] [2019-10-13 21:33:32,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:32,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:32,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927997742] [2019-10-13 21:33:32,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:32,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,555 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 21:33:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,598 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-13 21:33:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:32,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:33:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,612 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:33:32,612 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:33:32,618 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:33:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:33:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:33:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:33:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-13 21:33:32,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2019-10-13 21:33:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,659 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-13 21:33:32,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-10-13 21:33:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:33:32,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,661 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1265549521, now seen corresponding path program 1 times [2019-10-13 21:33:32,662 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293177168] [2019-10-13 21:33:32,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,752 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:33:32,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293177168] [2019-10-13 21:33:32,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:32,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:32,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868603579] [2019-10-13 21:33:32,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:32,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:32,757 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2019-10-13 21:33:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,800 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-10-13 21:33:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:32,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:33:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,804 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:33:32,804 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 21:33:32,805 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:33:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 21:33:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 21:33:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:33:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-13 21:33:32,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-10-13 21:33:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,813 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-13 21:33:32,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-13 21:33:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:33:32,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2130465201, now seen corresponding path program 1 times [2019-10-13 21:33:32,816 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423746605] [2019-10-13 21:33:32,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:32,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423746605] [2019-10-13 21:33:32,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891476271] [2019-10-13 21:33:32,916 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:33:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:32,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:32,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:33,049 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:33:33,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1254057669] [2019-10-13 21:33:33,119 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:33,119 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,134 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,143 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,149 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:33,296 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,542 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:34,778 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:34,906 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:34,940 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:34,948 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:34,949 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:34,950 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,950 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,950 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:34,951 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,951 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:34,955 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,956 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,957 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,957 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:33:34,958 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:33:34,958 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:34,958 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:34,958 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:34,959 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,960 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:34,961 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:34,961 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:35,321 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:35,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:35,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34023547] [2019-10-13 21:33:35,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:35,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:35,328 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-10-13 21:33:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:36,108 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-10-13 21:33:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:36,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-13 21:33:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:36,109 INFO L225 Difference]: With dead ends: 62 [2019-10-13 21:33:36,110 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:33:36,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:33:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-13 21:33:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:33:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-13 21:33:36,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2019-10-13 21:33:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:36,128 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-13 21:33:36,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-13 21:33:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:33:36,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:36,130 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:36,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:36,344 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:36,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1625797725, now seen corresponding path program 2 times [2019-10-13 21:33:36,345 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:36,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775789531] [2019-10-13 21:33:36,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:36,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775789531] [2019-10-13 21:33:36,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954216205] [2019-10-13 21:33:36,483 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:33:36,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:36,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:36,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:36,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:33:36,597 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:33:36,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1230353753] [2019-10-13 21:33:36,653 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:36,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:36,654 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:36,654 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:36,654 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:36,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:37,776 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:37,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:37,791 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:37,792 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:37,792 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,792 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,792 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:37,792 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 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-13 21:33:37,793 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:37,793 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,793 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,793 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,793 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:33:37,794 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:33:37,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:37,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:37,794 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:37,794 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,795 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:37,795 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:37,795 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 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-13 21:33:38,118 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:38,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:38,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51751286] [2019-10-13 21:33:38,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:38,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:38,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:38,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:38,121 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 23 states. [2019-10-13 21:33:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:39,152 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2019-10-13 21:33:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:39,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-10-13 21:33:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:39,157 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:33:39,157 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 21:33:39,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 21:33:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-13 21:33:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:33:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-10-13 21:33:39,171 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 30 [2019-10-13 21:33:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:39,171 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-10-13 21:33:39,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-10-13 21:33:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:33:39,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:39,173 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:39,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:39,390 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1820108783, now seen corresponding path program 3 times [2019-10-13 21:33:39,391 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:39,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105656621] [2019-10-13 21:33:39,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-13 21:33:39,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105656621] [2019-10-13 21:33:39,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741425248] [2019-10-13 21:33:39,557 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:39,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:39,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:39,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:39,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:39,755 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 21:33:39,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1044492625] [2019-10-13 21:33:39,882 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:39,882 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:39,883 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:39,883 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:39,883 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:39,915 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:40,881 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:40,889 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:40,894 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:40,895 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:40,895 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,895 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,895 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:40,896 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,896 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:40,896 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,896 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,896 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,897 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:33:40,897 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:33:40,897 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:40,897 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:40,898 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:40,898 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,898 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:33:40,898 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:40,899 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,253 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:41,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-13 21:33:41,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626988147] [2019-10-13 21:33:41,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:41,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:41,255 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 31 states. [2019-10-13 21:33:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:42,533 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-10-13 21:33:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:42,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2019-10-13 21:33:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:42,535 INFO L225 Difference]: With dead ends: 120 [2019-10-13 21:33:42,535 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 21:33:42,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 21:33:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-10-13 21:33:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 21:33:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-13 21:33:42,549 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 51 [2019-10-13 21:33:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:42,549 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-13 21:33:42,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-13 21:33:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:33:42,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:42,552 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:42,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:42,756 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash 664637921, now seen corresponding path program 4 times [2019-10-13 21:33:42,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:42,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881091282] [2019-10-13 21:33:42,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:42,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-13 21:33:42,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881091282] [2019-10-13 21:33:42,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749702583] [2019-10-13 21:33:42,996 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:43,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:43,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-13 21:33:43,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-13 21:33:43,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [942070858] [2019-10-13 21:33:43,361 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:43,362 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:43,362 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:43,362 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:43,362 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:43,382 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:44,204 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:44,443 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:44,449 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:44,452 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:44,453 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,453 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,454 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,454 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,454 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:33:44,455 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:33:44,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:44,455 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:44,455 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:44,455 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:44,456 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:44,456 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,753 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:44,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:33:44,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317951833] [2019-10-13 21:33:44,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:33:44,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:44,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:33:44,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:33:44,757 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 39 states. [2019-10-13 21:33:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:46,094 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2019-10-13 21:33:46,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:33:46,095 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2019-10-13 21:33:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:46,097 INFO L225 Difference]: With dead ends: 139 [2019-10-13 21:33:46,097 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:33:46,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:33:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:33:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-10-13 21:33:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 21:33:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-10-13 21:33:46,112 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 63 [2019-10-13 21:33:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:46,112 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-10-13 21:33:46,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:33:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-10-13 21:33:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:33:46,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:46,114 INFO L380 BasicCegarLoop]: trace histogram [26, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:46,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:46,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash -651474399, now seen corresponding path program 5 times [2019-10-13 21:33:46,319 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:46,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340108823] [2019-10-13 21:33:46,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:46,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:46,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-10-13 21:33:46,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340108823] [2019-10-13 21:33:46,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647076203] [2019-10-13 21:33:46,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:49,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:49,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:49,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:33:49,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-10-13 21:33:49,783 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-10-13 21:33:49,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [815254216] [2019-10-13 21:33:49,872 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:49,872 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:49,873 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:49,873 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:49,873 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:49,890 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:50,977 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:50,984 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:50,986 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:50,986 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:50,986 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,986 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,987 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:50,987 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:50,987 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:50,987 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,987 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,988 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,988 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:33:50,988 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:50,988 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:50,988 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:50,989 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,989 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,989 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:50,989 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:50,989 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:51,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:51,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11] total 29 [2019-10-13 21:33:51,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307315824] [2019-10-13 21:33:51,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:51,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:51,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:51,272 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 29 states. [2019-10-13 21:33:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,790 INFO L93 Difference]: Finished difference Result 176 states and 231 transitions. [2019-10-13 21:33:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:33:52,790 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2019-10-13 21:33:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,792 INFO L225 Difference]: With dead ends: 176 [2019-10-13 21:33:52,792 INFO L226 Difference]: Without dead ends: 135 [2019-10-13 21:33:52,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=591, Invalid=2061, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 21:33:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-13 21:33:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2019-10-13 21:33:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-13 21:33:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-10-13 21:33:52,811 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 77 [2019-10-13 21:33:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,811 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-10-13 21:33:52,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-10-13 21:33:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:33:52,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,814 INFO L380 BasicCegarLoop]: trace histogram [26, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:53,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:53,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1559615779, now seen corresponding path program 6 times [2019-10-13 21:33:53,017 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:53,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175634817] [2019-10-13 21:33:53,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:53,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:53,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-10-13 21:33:53,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175634817] [2019-10-13 21:33:53,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625163320] [2019-10-13 21:33:53,281 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:53,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:53,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:33:53,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-13 21:33:54,125 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-13 21:33:55,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354566115] [2019-10-13 21:33:55,395 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:33:55,396 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:55,396 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:55,396 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:55,397 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:55,411 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:56,486 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:56,492 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:56,494 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:56,494 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,495 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,496 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,496 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:33:56,496 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:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:56,497 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:33:56,498 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:33:56,498 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:56,969 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:56,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 29, 11] total 83 [2019-10-13 21:33:56,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179472736] [2019-10-13 21:33:56,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-13 21:33:56,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:56,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-13 21:33:56,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=5067, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 21:33:56,974 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 83 states. [2019-10-13 21:34:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:01,777 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2019-10-13 21:34:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-13 21:34:01,778 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 122 [2019-10-13 21:34:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:01,780 INFO L225 Difference]: With dead ends: 262 [2019-10-13 21:34:01,780 INFO L226 Difference]: Without dead ends: 168 [2019-10-13 21:34:01,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6056 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5245, Invalid=20515, Unknown=0, NotChecked=0, Total=25760 [2019-10-13 21:34:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-13 21:34:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-13 21:34:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-13 21:34:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 165 transitions. [2019-10-13 21:34:01,805 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 165 transitions. Word has length 122 [2019-10-13 21:34:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:01,806 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 165 transitions. [2019-10-13 21:34:01,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-13 21:34:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 165 transitions. [2019-10-13 21:34:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:34:01,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:01,809 INFO L380 BasicCegarLoop]: trace histogram [54, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:02,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:02,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 797984737, now seen corresponding path program 7 times [2019-10-13 21:34:02,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:02,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602922637] [2019-10-13 21:34:02,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2019-10-13 21:34:02,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602922637] [2019-10-13 21:34:02,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49905154] [2019-10-13 21:34:02,397 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:02,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:34:02,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-13 21:34:04,169 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2019-10-13 21:34:07,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564670585] [2019-10-13 21:34:07,806 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:34:07,806 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:07,807 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:07,807 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:07,807 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:07,824 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:08,773 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:08,779 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:08,782 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:08,782 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:08,782 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 303#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:08,783 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:08,783 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 293#(and (= |main_#t~mem13| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* main_~x~0 4) |main_~#a6~0.offset|)))) [2019-10-13 21:34:08,783 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:08,784 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 317#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:08,784 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:08,784 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:08,785 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:08,785 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:34:08,785 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:34:08,785 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 322#(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:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 288#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 298#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) [2019-10-13 21:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 68#true [2019-10-13 21:34:08,786 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 313#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:09,435 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:09,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 57, 57, 11] total 140 [2019-10-13 21:34:09,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144077120] [2019-10-13 21:34:09,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-10-13 21:34:09,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-10-13 21:34:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6434, Invalid=13026, Unknown=0, NotChecked=0, Total=19460 [2019-10-13 21:34:09,443 INFO L87 Difference]: Start difference. First operand 159 states and 165 transitions. Second operand 140 states.