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_two_index_05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:27:42,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:27:42,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:27:42,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:27:42,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:27:42,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:27:42,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:27:42,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:27:42,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:27:42,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:27:42,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:27:42,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:27:42,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:27:42,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:27:42,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:27:42,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:27:42,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:27:42,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:27:42,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:27:42,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:27:42,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:27:42,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:27:42,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:27:42,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:27:42,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:27:42,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:27:42,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:27:42,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:27:42,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:27:42,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:27:42,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:27:42,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:27:42,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:27:42,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:27:42,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:27:42,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:27:42,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:27:42,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:27:42,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:27:42,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:27:42,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:27:42,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:27:43,011 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:27:43,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:27:43,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:27:43,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:27:43,013 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:27:43,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:27:43,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:27:43,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:27:43,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:27:43,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:27:43,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:27:43,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:27:43,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:27:43,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:27:43,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:27:43,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:27:43,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:27:43,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:27:43,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:27:43,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:27:43,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:27:43,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:27:43,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:27:43,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:27:43,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:27:43,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:27:43,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:27:43,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:27:43,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:27:43,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:27:43,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:27:43,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:27:43,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:27:43,346 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:27:43,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_05.i [2019-10-07 00:27:43,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60b69df/29486a663e0c42bca5550916d050cef5/FLAGb222723d9 [2019-10-07 00:27:43,924 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:27:43,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_05.i [2019-10-07 00:27:43,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60b69df/29486a663e0c42bca5550916d050cef5/FLAGb222723d9 [2019-10-07 00:27:44,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc60b69df/29486a663e0c42bca5550916d050cef5 [2019-10-07 00:27:44,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:27:44,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:27:44,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:27:44,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:27:44,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:27:44,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4bcf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44, skipping insertion in model container [2019-10-07 00:27:44,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:27:44,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:27:44,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:27:44,636 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:27:44,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:27:44,675 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:27:44,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44 WrapperNode [2019-10-07 00:27:44,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:27:44,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:27:44,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:27:44,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:27:44,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... [2019-10-07 00:27:44,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:27:44,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:27:44,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:27:44,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:27:44,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:27:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:27:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:27:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:27:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:27:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:27:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:27:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:27:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:27:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:27:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:27:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:27:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:27:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:27:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:27:45,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:27:45,239 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:27:45,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:27:45 BoogieIcfgContainer [2019-10-07 00:27:45,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:27:45,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:27:45,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:27:45,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:27:45,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:27:44" (1/3) ... [2019-10-07 00:27:45,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbcffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:27:45, skipping insertion in model container [2019-10-07 00:27:45,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:27:44" (2/3) ... [2019-10-07 00:27:45,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbcffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:27:45, skipping insertion in model container [2019-10-07 00:27:45,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:27:45" (3/3) ... [2019-10-07 00:27:45,250 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_05.i [2019-10-07 00:27:45,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:27:45,269 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:27:45,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:27:45,304 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:27:45,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:27:45,304 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:27:45,305 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:27:45,305 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:27:45,305 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:27:45,305 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:27:45,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:27:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:27:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:27:45,330 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:45,331 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:45,334 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:27:45,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:45,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:27:45,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,520 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:27:45,520 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:27:45,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:27:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:27:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:27:45,537 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:27:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:45,596 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:27:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:27:45,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:27:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:45,607 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:27:45,607 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:27:45,611 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:27:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:27:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:27:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:27:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:27:45,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:27:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:45,655 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:27:45,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:27:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:27:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:27:45,657 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:45,657 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:45,657 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-07 00:27:45,658 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:45,659 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:45,717 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-07 00:27:45,718 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,718 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:27:45,718 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:27:45,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:27:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:27:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:27:45,724 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:27:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:45,787 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:27:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:27:45,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:27:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:45,792 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:27:45,792 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:27:45,795 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:27:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:27:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:27:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:27:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:27:45,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:27:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:45,816 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:27:45,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:27:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:27:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:27:45,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:45,820 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:45,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:27:45,822 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:45,823 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,823 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,823 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:27:45,963 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:45,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:46,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:27:46,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:27:46,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:27:46,164 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:46,206 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:46,207 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:46,211 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:46,220 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:46,221 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:46,379 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:46,828 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-07 00:27:46,948 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:46,963 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:46,969 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:46,970 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:46,970 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:46,970 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:46,971 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:46,971 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:46,971 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:46,971 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:46,972 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:46,972 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:46,972 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:46,973 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:46,973 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:46,973 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:46,973 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-07 00:27:47,349 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:47,349 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:27:47,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:27:47,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:27:47,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:27:47,352 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:27:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:48,160 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-07 00:27:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:27:48,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:27:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:48,162 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:27:48,162 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:27:48,163 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:27:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:27:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-07 00:27:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:27:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:27:48,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:27:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:48,177 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:27:48,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:27:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:27:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:27:48,179 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:48,179 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:48,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:48,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-07 00:27:48,394 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:48,394 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:48,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:48,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:27:48,505 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:48,505 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:48,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:48,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:27:48,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:27:48,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:27:48,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:27:48,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:27:48,646 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:48,647 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:48,648 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:48,648 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:48,648 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:48,649 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:48,680 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:49,042 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:49,060 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:49,066 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:49,066 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:49,067 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:49,067 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:49,068 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:49,068 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:49,069 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:49,069 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:49,069 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:49,070 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:49,070 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:49,070 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:49,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:49,071 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:49,071 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-07 00:27:49,347 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:49,348 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-07 00:27:49,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:27:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:27:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:27:49,351 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-07 00:27:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:50,363 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-07 00:27:50,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:27:50,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-07 00:27:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:50,365 INFO L225 Difference]: With dead ends: 73 [2019-10-07 00:27:50,365 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:27:50,366 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:27:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:27:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-07 00:27:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:27:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:27:50,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-07 00:27:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:50,377 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:27:50,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:27:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:27:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:27:50,379 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:50,379 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:50,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:50,584 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-07 00:27:50,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:50,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:50,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:50,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:27:50,763 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:50,763 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:50,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:50,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:27:50,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:27:50,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:27:50,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:27:50,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:27:51,077 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:51,079 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:51,079 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:51,080 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:51,080 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:51,080 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:51,118 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:51,443 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:51,466 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:51,472 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:51,472 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:51,473 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:51,473 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:51,473 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:51,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:51,474 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:51,474 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:51,474 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:51,475 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:51,475 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:51,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:51,476 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:51,476 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:51,476 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:27:51,835 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:51,835 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 38 [2019-10-07 00:27:51,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 00:27:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 00:27:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 00:27:51,840 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 38 states. [2019-10-07 00:27:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:27:53,859 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2019-10-07 00:27:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:27:53,859 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-10-07 00:27:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:27:53,862 INFO L225 Difference]: With dead ends: 109 [2019-10-07 00:27:53,862 INFO L226 Difference]: Without dead ends: 91 [2019-10-07 00:27:53,866 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1756, Invalid=4886, Unknown=0, NotChecked=0, Total=6642 [2019-10-07 00:27:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-07 00:27:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-10-07 00:27:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-07 00:27:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-07 00:27:53,880 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28 [2019-10-07 00:27:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:27:53,880 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-07 00:27:53,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 00:27:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-07 00:27:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 00:27:53,882 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:27:53,882 INFO L385 BasicCegarLoop]: trace histogram [25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:27:54,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:54,087 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:27:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:27:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash 102164889, now seen corresponding path program 4 times [2019-10-07 00:27:54,088 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:27:54,089 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:54,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:54,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:27:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:27:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-07 00:27:54,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:27:54,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:27:54,310 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:27:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:27:54,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-07 00:27:54,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:27:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:27:54,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:27:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:27:55,270 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:27:55,272 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:27:55,272 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:27:55,276 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:27:55,277 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:27:55,277 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:27:55,345 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:27:55,710 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:27:55,721 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:27:55,726 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:27:55,727 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:27:55,727 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:55,727 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:55,727 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:55,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:27:55,728 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:27:55,728 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:55,728 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:55,728 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:27:55,729 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:27:55,729 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:27:55,729 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:27:55,729 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:27:55,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:27:56,042 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:27:56,042 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 28, 11] total 72 [2019-10-07 00:27:56,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-07 00:27:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-07 00:27:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2038, Invalid=3074, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 00:27:56,048 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 72 states. [2019-10-07 00:28:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:00,881 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-10-07 00:28:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-07 00:28:00,881 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 48 [2019-10-07 00:28:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:00,884 INFO L225 Difference]: With dead ends: 172 [2019-10-07 00:28:00,884 INFO L226 Difference]: Without dead ends: 151 [2019-10-07 00:28:00,895 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8624 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7326, Invalid=16854, Unknown=0, NotChecked=0, Total=24180 [2019-10-07 00:28:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-07 00:28:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2019-10-07 00:28:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 00:28:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-10-07 00:28:00,915 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 48 [2019-10-07 00:28:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:00,915 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-10-07 00:28:00,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-07 00:28:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-10-07 00:28:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 00:28:00,918 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:00,918 INFO L385 BasicCegarLoop]: trace histogram [59, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:01,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:01,128 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1137625480, now seen corresponding path program 5 times [2019-10-07 00:28:01,130 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:01,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:01,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:01,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-07 00:28:01,464 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:01,464 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:01,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:12,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-07 00:28:12,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:12,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-07 00:28:12,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-07 00:28:12,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-07 00:28:12,538 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:12,539 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:12,539 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:12,540 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:12,540 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:12,540 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:12,566 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:12,835 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:12,845 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:12,848 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:12,848 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:12,848 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:12,849 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:12,849 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:12,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:12,849 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:12,849 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:12,850 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 00:28:12,850 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:12,850 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:12,850 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:12,851 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:12,851 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:12,851 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:28:13,155 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:13,155 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 11] total 51 [2019-10-07 00:28:13,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-07 00:28:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-07 00:28:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=1622, Unknown=0, NotChecked=0, Total=2550 [2019-10-07 00:28:13,159 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 51 states. [2019-10-07 00:28:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:18,501 INFO L93 Difference]: Finished difference Result 240 states and 298 transitions. [2019-10-07 00:28:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-07 00:28:18,501 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 89 [2019-10-07 00:28:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:18,505 INFO L225 Difference]: With dead ends: 240 [2019-10-07 00:28:18,506 INFO L226 Difference]: Without dead ends: 231 [2019-10-07 00:28:18,511 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5146, Invalid=12676, Unknown=0, NotChecked=0, Total=17822 [2019-10-07 00:28:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-07 00:28:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 113. [2019-10-07 00:28:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-07 00:28:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-10-07 00:28:18,545 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 89 [2019-10-07 00:28:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:18,545 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-10-07 00:28:18,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-07 00:28:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-10-07 00:28:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-07 00:28:18,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:18,548 INFO L385 BasicCegarLoop]: trace histogram [59, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:18,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:18,758 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash 854243016, now seen corresponding path program 6 times [2019-10-07 00:28:18,759 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:18,759 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:18,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:18,760 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-07 00:28:19,694 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:19,694 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:19,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:19,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:28:19,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:19,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-07 00:28:19,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-07 00:28:20,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-07 00:28:23,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:23,471 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:23,471 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:23,471 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:23,472 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:23,472 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:23,501 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:23,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:28:23,756 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:23,759 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:23,759 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:23,760 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:28:23,761 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:23,761 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:23,761 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:23,762 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:23,762 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-07 00:28:24,168 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:24,169 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 62, 62, 11] total 160 [2019-10-07 00:28:24,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-10-07 00:28:24,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-10-07 00:28:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11498, Invalid=13942, Unknown=0, NotChecked=0, Total=25440 [2019-10-07 00:28:24,175 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 160 states. [2019-10-07 00:28:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:46,615 INFO L93 Difference]: Finished difference Result 421 states and 575 transitions. [2019-10-07 00:28:46,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2019-10-07 00:28:46,616 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 109 [2019-10-07 00:28:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:46,620 INFO L225 Difference]: With dead ends: 421 [2019-10-07 00:28:46,620 INFO L226 Difference]: Without dead ends: 373 [2019-10-07 00:28:46,628 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46122 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=43501, Invalid=90089, Unknown=0, NotChecked=0, Total=133590 [2019-10-07 00:28:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-07 00:28:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 214. [2019-10-07 00:28:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-07 00:28:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2019-10-07 00:28:46,659 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 109 [2019-10-07 00:28:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:46,660 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2019-10-07 00:28:46,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-10-07 00:28:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2019-10-07 00:28:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-07 00:28:46,664 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:46,664 INFO L385 BasicCegarLoop]: trace histogram [147, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:46,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:46,870 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1010918759, now seen corresponding path program 7 times [2019-10-07 00:28:46,871 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:46,871 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:46,871 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:46,872 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12204 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2019-10-07 00:28:48,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:48,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:48,384 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:48,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 149 conjunts are in the unsatisfiable core [2019-10-07 00:28:48,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12204 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-10-07 00:28:50,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12204 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-10-07 00:29:04,415 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:04,416 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:04,416 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:04,417 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:04,417 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:04,417 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:04,444 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:04,713 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:04,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:04,723 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:04,723 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:04,723 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:04,723 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:04,724 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:04,724 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:04,724 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:04,724 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:04,724 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:04,725 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 20 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:04,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:04,725 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:04,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:04,725 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:04,726 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) [2019-10-07 00:29:05,200 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:05,200 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 150, 150, 11] total 331 [2019-10-07 00:29:05,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 331 states [2019-10-07 00:29:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 331 interpolants. [2019-10-07 00:29:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52025, Invalid=57205, Unknown=0, NotChecked=0, Total=109230 [2019-10-07 00:29:05,216 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 331 states. [2019-10-07 00:30:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:14,158 INFO L93 Difference]: Finished difference Result 729 states and 1015 transitions. [2019-10-07 00:30:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2019-10-07 00:30:14,158 INFO L78 Accepts]: Start accepts. Automaton has 331 states. Word has length 210 [2019-10-07 00:30:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:14,164 INFO L225 Difference]: With dead ends: 729 [2019-10-07 00:30:14,164 INFO L226 Difference]: Without dead ends: 668 [2019-10-07 00:30:14,181 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 737 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199089 ImplicationChecksByTransitivity, 68.9s TimeCoverageRelationStatistics Valid=185632, Invalid=359750, Unknown=0, NotChecked=0, Total=545382 [2019-10-07 00:30:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-10-07 00:30:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 416. [2019-10-07 00:30:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-07 00:30:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 418 transitions. [2019-10-07 00:30:14,230 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 418 transitions. Word has length 210 [2019-10-07 00:30:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:14,231 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 418 transitions. [2019-10-07 00:30:14,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 331 states. [2019-10-07 00:30:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 418 transitions. [2019-10-07 00:30:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-07 00:30:14,239 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:14,240 INFO L385 BasicCegarLoop]: trace histogram [318, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:14,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:14,450 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash -395444100, now seen corresponding path program 8 times [2019-10-07 00:30:14,451 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:14,451 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:14,451 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:14,451 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 54124 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 50721 trivial. 0 not checked. [2019-10-07 00:30:18,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:18,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:18,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true